( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational complexity of covering three-vertex multigraphs.

, , и . Theor. Comput. Sci., (2016)

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.

Jan Kratochvíl

Alexander Kratochvil

Ulla Kratochvil

Pavel Kratochvil

Zora Kratochvil

 

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

On the Complexity of Reconstructing H -free Graphs from Their Star Systems., , , , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 194-205. Springer, (2008)Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2008)Distance Constrained Labelings of Graphs of Bounded Treewidth., , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 360-372. Springer, (2005)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 182-191. Springer, (2008)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 348-359. Springer, (2012)Completion of the Mixed Unit Interval Graphs Hierarchy., и . TAMC, том 9076 из Lecture Notes in Computer Science, стр. 284-296. Springer, (2015)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 160-169. Springer, (2002)Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number., и . CoRR, (2023)Guest editors' foreword., , и . Discret. Appl. Math., 157 (12): 2575-2576 (2009)Transversal Partitioning in Balanced Hypergraphs., , , и . Discret. Appl. Math., 79 (1-3): 75-89 (1997)