( en | de | ru )

 

Disambiguation of "Schiermeyer, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
A Rainbow k-Matching in the Complete Graph with r Colors.

, , , and . Electron. J. Comb., (2009)

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.

Ingo Schiermeyer

Ingo Schiermeyer

Ingo Schiermeyer

Ingo Schiermeyer

Joachim Schiermeyer

 

Other publications of authors with the same name

Approximating Maximum Independent Set in k-Clique-Free Graphs.. APPROX, volume 1444 of Lecture Notes in Computer Science, page 159-168. Springer, (1998)Rainbow Connection in Graphs with Minimum Degree Three.. IWOCA, volume 5874 of Lecture Notes in Computer Science, page 432-437. Springer, (2009)A Rainbow k-Matching in the Complete Graph with r Colors., , , and . Electron. J. Comb., (2009)Complete bipartite graphs without small rainbow subgraphs., , , and . Discret. Appl. Math., (2024)Two-factors each component of which contains a specified vertex., , , , and . J. Graph Theory, 43 (3): 188-198 (2003)Closure Concepts: A Survey., , and . Graphs Comb., 16 (1): 17-48 (2000)A planarity criterion for cubic bipartite graphs., , , and . Discret. Math., 191 (1-3): 31-43 (1998)An Approximation Algorithm for 3-Colourability.. WG, volume 1017 of Lecture Notes in Computer Science, page 146-151. Springer, (1995)Bounds for the rainbow connection number of graphs.. Discussiones Mathematicae Graph Theory, 31 (2): 387-395 (2011)3-Colorability element oF P for p6-free Graphs., and . Electron. Notes Discret. Math., (2001)