Details: Bert Randerath, Ingo Schiermeyer
Chromatic number of P5-free graphs
4-colorability of P6-free graphs ⋆
Details: Bert Randerath, Ingo Schiermeyer
arXiv:1709.02475v1 [math.CO] 7 Sep 2017
Institut für Diskrete Mathematik und Algebra - TU Bergakademie Freiberg
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
Schiermeyer in der Personensuche von Das Telefonbuch
Ingo SCHIERMEYER | Chair for Applied Discrete Mathematics | Prof. Dr. rer. nat. habil. | Technische Universität Bergakademie Freiberg, Freiberg | Institute of Discrete Mathematics and Algebra | Research profile
Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory
ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1
On polynomial chi-binding functions - ppt download
PDF) Extending the MAX Algorithm for Maximum Independent Set
Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer
PROPER RAINBOW CONNECTION NUMBER OF GRAPHS
References
Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer
On the chromatic number of (P_{5},windmill)-free graphs
View > News & Events > News & Events > Applied Mathematics and Statistics
Random Procedures for Dominating Sets in Graphs
Chromatic Number of Graphs each Path of which is 3-colourable
GRAPHS WITH 3-RAINBOW INDEX n − 1 AND n − 2
On the minimum rainbow subgraph number of a graph Ingo Schiermeyer Abstract We consider the Minimum Rainbow Subgraph problem (MR
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
On computing the minimum 3-path vertex cover and dissociation number of graphs
