Jan Kratochvı́l

A special planar satisfiability problem and a consequence of its NP-completeness

Jan Kratochvı́l · Discrete Applied Mathematics · 1994 · 199 citations

Computing, Computer Science, Mathematics +7

String graphs. II. recognizing string graphs is NP-hard

Jan Kratochvı́l · Journal of Combinatorial Theory Series B · 1991 · 157 citations

Computing, Computer Science, Mathematics +10

On the injective chromatic number of graphs

Geňa Hahn, Jan Kratochvı́l, Jozef Širáň et al. · Discrete Mathematics · 2002 · 134 citations

Natural Sciences, Mathematics, Combinatorics +4

Fixed-parameter complexity of λ-labelings

Jiřı́ Fiala, Ton Kloks, Jan Kratochvı́l · Discrete Applied Mathematics · 2001 · 131 citations

Computing, Computer Science, Mathematics +12

Covering and coloring polygon-circle graphs

Alexandr Kostochka, Jan Kratochvı́l · Discrete Mathematics · 1997 · 99 citations

Natural Sciences, Mathematics, Combinatorics +10