( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Path-Tough Graphs.

, , и . SIAM J. Discret. Math., 7 (4): 571-584 (1994)

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.

Ingo Schiermeyer

Ingo Schiermeyer

Ingo Schiermeyer

Ingo Schiermeyer

Joachim Schiermeyer

 

Другие публикации лиц с тем же именем

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