( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

, , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)

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.

Jan Kratochvíl

Alexander Kratochvil

Pavel Kratochvil

Zora Kratochvil

Ulla Kratochvil

 

Other publications of authors with the same name

On tractability of Cops and Robbers game., , and . IFIP TCS, volume 273 of IFIP, page 171-185. Springer, (2008)Preface., and . Eur. J. Comb., (2018)Preface., , and . Discret. Math., 310 (3): 371-372 (2010)Complexity of choosing subsets from color sets., , and . Discret. Math., 191 (1-3): 139-148 (1998)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters., , , and . GD, volume 5417 of Lecture Notes in Computer Science, page 121-132. Springer, (2008)Two Results on Intersection Graphs of Polygons., and . GD, volume 2912 of Lecture Notes in Computer Science, page 59-70. Springer, (2003)Parameterized Complexity of Generalized Domination Problems., , and . WG, volume 5911 of Lecture Notes in Computer Science, page 133-142. (2009)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)Distance Constrained Labelings of Graphs of Bounded Treewidth., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 360-372. Springer, (2005)