Details: Bert Randerath, Ingo Schiermeyer
Proper Connection Number of Graphs
Details: Bert Randerath, Ingo Schiermeyer
Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory
Chromatic Number of Graphs each Path of which is 3-colourable
On computing the minimum 3-path vertex cover and dissociation number of graphs
arXiv:1709.02475v1 [math.CO] 7 Sep 2017
PDF) Graphs with 3-rainbow index n-1 and n-2 | Ingo Schiermeyer - Academia.edu
Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer
4-colorability of P6-free graphs ⋆
ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1
Schiermeyer in der Personensuche von Das Telefonbuch
On computing the minimum 3-path vertex cover and dissociation number of graphs
References
Rainbow Connection in Graphs with Minimum Degree Three
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
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
Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer
On polynomial chi-binding functions - ppt download
Details: Ingo Schiermeyer
4-colorability of P6-free graphs ⋆
