- Home
- Top Scientists - Mathematics
- Jan Kratochvíl

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
H-index
35
Citations
4,858
159
World Ranking
1481
National Ranking
8

Computer Science
H-index
35
Citations
4,704
151
World Ranking
5990
National Ranking
10

- Combinatorics
- Discrete mathematics
- Graph theory

His primary areas of study are Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Pathwidth. Graph, Planar graph, Complete coloring, Graph coloring and Modular decomposition are the subjects of his Combinatorics studies. His Graph research integrates issues from Graph theory and Combinatorial optimization.

His study connects Parameterized complexity and Discrete mathematics. His Chordal graph research is multidisciplinary, relying on both Completeness, Plane and Boolean satisfiability problem. The Indifference graph study combines topics in areas such as 1-planar graph, Strong perfect graph theorem, Intersection, Grid and Boxicity.

- Complexity of Coloring Graphs without Forbidden Induced Subgraphs (176 citations)
- A special planar satisfiability problem and a consequence of its NP-completeness (175 citations)
- String graphs. II.: Recognizing string graphs is NP-hard (133 citations)

His primary areas of investigation include Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Graph. Disjoint sets is closely connected to Computational complexity theory in his research, which is encompassed under the umbrella topic of Combinatorics. His study involves Pathwidth, Interval graph, Intersection graph, Split graph and Complement graph, a branch of Discrete mathematics.

His biological study spans a wide range of topics, including Independent set and Treewidth. He works mostly in the field of Indifference graph, limiting it down to topics relating to Trapezoid graph and, in certain cases, Permutation graph, as a part of the same area of interest. His work in the fields of Graph, such as Vertex, intersects with other areas such as Partial representation.

- Combinatorics (81.71%)
- Discrete mathematics (64.63%)
- Chordal graph (23.58%)

- Combinatorics (81.71%)
- Discrete mathematics (64.63%)
- Graph (19.51%)

His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Planar graph and Bounded function. Combinatorics connects with themes related to Upper and lower bounds in his study. His research in Discrete mathematics focuses on subjects like Computational complexity theory, which are connected to Multiple edges.

As a part of the same scientific family, he mostly works in the field of Graph, focusing on Grid and, on occasion, Stub, Hamiltonian path and Conjecture. His Planar graph study incorporates themes from Planarity testing and Outerplanar graph. His biological study deals with issues like Chordal graph, which deal with fields such as Pathwidth.

- Testing Planarity of Partially Embedded Graphs (37 citations)
- Extending Partial Representations of Proper and Unit Interval Graphs (28 citations)
- Extending partial representations of subclasses of chordal graphs (22 citations)

- Combinatorics
- Graph theory
- Geometry

Jan Kratochvíl mainly focuses on Combinatorics, Discrete mathematics, Interval graph, Planar graph and Planarity testing. His Combinatorics study focuses on Unit interval graphs in particular. His research on Discrete mathematics often connects related areas such as Bounded function.

He has researched Interval graph in several fields, including Intersection graph and Indifference graph. His work carried out in the field of Planar graph brings together such families of science as Homogeneous space, Graph embedding, Regular graph, Book embedding and Outerplanar graph. His Planarity testing research is multidisciplinary, incorporating perspectives in Geometry and topology, Planar straight-line graph, Topological graph theory and Computational science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

Jan Kratochvíl.

Discrete Applied Mathematics **(1994)**

226 Citations

String graphs. II.: Recognizing string graphs is NP-hard

Jan Kratochvíl.

Journal of Combinatorial Theory, Series B **(1991)**

191 Citations

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger.

workshop on graph theoretic concepts in computer science **(2001)**

180 Citations

On the b-Chromatic Number of Graphs

Jan Kratochvíl;Zsolt Tuza;Margit Voigt.

workshop on graph theoretic concepts in computer science **(2002)**

173 Citations

Fixed parameter complexity of λ-labelings

Jiri Fiala;Ton Kloks;Jan Kratochvil.

workshop on graph theoretic concepts in computer science **(2001)**

153 Citations

Covering and coloring polygon-circle graphs

Alexandr Kostochka;Jan Kratochvíl.

Discrete Mathematics **(1997)**

119 Citations

On the injective chromatic number of graphs

Gena Hahn;Jan Kratochvíl;Jozef Sirán;Dominique Sotteau.

Discrete Mathematics **(2002)**

119 Citations

On the computation of the hull number of a graph

Mitre C. Dourado;John G. Gimbel;Jan Kratochvíl;Fábio Protti.

Discrete Mathematics **(2009)**

112 Citations

String graphs requiring exponential representations

Jan Kratochvíl;Jiří Matoušek.

Journal of Combinatorial Theory, Series B **(1991)**

111 Citations

Representing graphs by disks and balls (a survey of recognition-complexity results)

Petr Hliněný;Jan Kratochvíl.

Discrete Mathematics **(2001)**

99 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

University of Oregon

University of Bergen

University of Pannonia

Reykjavík University

University of Lorraine

University of Tübingen

RWTH Aachen University

Roma Tre University

Charles University

University of Crete

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.