( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Disjoint dominating sets with a perfect matching.

, , и . Discret. Math. Algorithms Appl., 9 (5): 1750065:1-1750065:20 (2017)

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.

Jochen Messinger

Alexander Messinger

Markus Messinger

Jens Meßinger

Philipp Messinger

 

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

The Robot Cleans Up., и . COCOA, том 5165 из Lecture Notes in Computer Science, стр. 309-318. Springer, (2008)Disjoint dominating sets with a perfect matching., , и . Discret. Math. Algorithms Appl., 9 (5): 1750065:1-1750065:20 (2017)A note on bounds for the cop number using tree decompositions., , , , и . Contributions Discret. Math., (2014)Hamilton Paths in Dominating Graphs of Trees and Cycles., , , , , , и . Graphs Comb., 38 (6): 174 (2022)Dominating vertex covers: the vertex-edge domination problem., , и . Discuss. Math. Graph Theory, 41 (1): 123-132 (2021)Parallel cleaning of a network with brushes., , , и . Discret. Appl. Math., 158 (5): 467-478 (2010)Clean the graph before you draw it!, , , и . Inf. Process. Lett., 109 (10): 463-467 (2009)Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm., , , и . CAAN, том 4852 из Lecture Notes in Computer Science, стр. 13-26. Springer, (2007)A note on hyperopic cops and robber., , , и . Discret. Math. Algorithms Appl., 15 (5): 2250127:1-2250127:14 (июля 2023)A note on bounds for the cop number using tree decompositions., , , , и . CoRR, (2013)