( en | de | ru )

 

Disambiguation of "Schiermeyer, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
On computing the minimum 3-path vertex cover and dissociation number of graphs.

, , and . Theor. Comput. Sci., 412 (50): 7009-7017 (2011)

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

Two-factors each component of which contains a specified vertex., , , , and . J. Graph Theory, 43 (3): 188-198 (2003)Closures, cycles, and paths., , , and . J. Graph Theory, 69 (3): 314-323 (2012)On F-independence in graphs., , , and . Discuss. Math. Graph Theory, 29 (2): 377-383 (2009)On Path-Tough Graphs., , and . SIAM J. Discret. Math., 7 (4): 571-584 (1994)Minimum Degree Conditions for the Proper Connection Number of Graphs., , and . Graphs Comb., 33 (4): 833-843 (2017)On Star-Wheel Ramsey Numbers., and . Graphs Comb., 32 (2): 733-739 (2016)Bounds for the rainbow connection number of graphs.. Discussiones Mathematicae Graph Theory, 31 (2): 387-395 (2011)Graphs with 4-rainbow index 3 and n-1., , , and . Discussiones Mathematicae Graph Theory, 35 (2): 387-398 (2015)Rainbow connection in sparse graphs., , , and . Discussiones Mathematicae Graph Theory, 33 (1): 181-192 (2013)3-Colorability in P for P6-free graphs., and . Discret. Appl. Math., 136 (2-3): 299-313 (2004)