( en | de | ru )

 

Disambiguation of "Schaudt, Oliver"

Author of the publication

copydeleteadd this publication to your clipboard
Obstructions for three-coloring graphs without induced paths on six vertices.

, , , and . J. Comb. Theory, Ser. B, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oliver Schaudt

Oliver Schaudt

Ursula Schaudt

Marco Schaudt

Heidrun Schaudt

 

Other publications of authors with the same name

Obstructions for three-coloring graphs with one forbidden induced subgraph., , , and . SODA, page 1774-1783. SIAM, (2016)On graphs for which the connected domination number is at most the total domination number.. Discret. Appl. Math., 160 (7-8): 1281-1284 (2012)Stackelberg packing games., , and . Theor. Comput. Sci., (2023)On the Complexity of Stackelberg Matroid Pricing Problems., and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 83-96. Springer, (2020)On Bounding the Difference of the Maximum Degree and the Clique Number., and . Graphs Comb., 31 (5): 1689-1702 (2015)b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs., , , and . Algorithmica, 73 (2): 289-305 (2015)b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 100-111. Springer, (2014)Connected dominating set in graphs without long paths and cycles., and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 39-42. (2013)Stackelberg Packing Games., , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 239-253. Springer, (2019)On bounding the difference between the maximum degree and the chromatic number by a constant., and . Discret. Appl. Math., (2017)