GRAPHS WITH 3-RAINBOW INDEX n − 1 AND n − 2
PDF) Graphs with 3-rainbow index n-1 and n-2 | Ingo Schiermeyer - Academia.edu
ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1
Random Procedures for Dominating Sets in Graphs
Details: Bert Randerath, Ingo Schiermeyer
On the minimum rainbow subgraph number of a graph Ingo Schiermeyer Abstract We consider the Minimum Rainbow Subgraph problem (MR
Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer
Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer
Rainbow Connection in Graphs with Minimum Degree Three
PROPER RAINBOW CONNECTION NUMBER OF GRAPHS
Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory
On polynomial chi-binding functions - ppt download
Norbert Neuser - Superteam for Africa Together We Can Großer Erfolg für die Afrika-Woche unserer S-D-Fraktion in Brüssel und mit den "Go-Local-Veranstaltungen" in Brüssel, Rom und Mainz - machbar nur mit einem
arXiv:1709.02475v1 [math.CO] 7 Sep 2017
Ingo Schiermeyer – Professor – TU Bergakademie Freiberg | LinkedIn
Monday 9.00: opening 9.15-10.15: Sophie Spirkl: 4-Coloring P6-free graphs 10.15-10.45: coffee/tea break 10.45-12.00: Paul
On computing the minimum 3-path vertex cover and dissociation number of graphs
Colourings, Independence, and (Forbidden) Subgraphs
Chromatic Number of Graphs each Path of which is 3-colourable
Details: Bert Randerath, Ingo Schiermeyer
ON THE COMPUTATIONAL COMPLEXITY OF (O, P)-PARTITION PROBLEMS
Mini Workshop về Tổ hợp, Lý thuyết Đồ thị và Ứng dụng - Viện nghiên cứu cao cấp về toán
