Concepedia

Jaroslav Nešetřil

JN

116

Publications

5.9K

Citations

40

H-Index

1970

Active since

Affiliations

Charles University(Current)

Centre d'Analyse et de Mathématique Sociales

Czech Technical University in Prague

Centre National de la Recherche Scientifique

Simon Fraser University

Jaroslav Nešetřil is an author at Charles University specializing in discrete mathematics, graph theory, and combinatorial optimization.

Top concepts

Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringComputer ScienceComputational ComplexityNetwork AnalysisBusinessEducationMathematical Programming

Publications per year

1970–2020

116

Publications

116

On the complexity of H-coloring

Pavol Hell, Jaroslav Nešetřil · Journal of Combinatorial Theory Series B · 1990 · 663 citations

Combinatorics On Word, Computational Complexity Theory, Engineering +4

Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history

Jaroslav Nešetřil, Eva Milková, Helena Nešetřilová · Discrete Mathematics · 2001 · 302 citations

Mathematical Programming, Graph Minor, Engineering +9

On the complexity of the subgraph problem

Jaroslav Nešetřil, Svatopluk Poljak · Czech digital mathematics library · 1985 · 229 citations · Full text

Tree-depth, subgraph coloring and homomorphism bounds

Jaroslav Nešetřil, Patrice Ossona de Mendez · European Journal of Combinatorics · 2005 · 215 citations

Subgraph Coloring, Graph Minor, Engineering +6

The core of a graph

Pavol Hell, Jaroslav Nešetřil · Discrete Mathematics · 1992 · 204 citations

Network Science, Graph Theory, Structural Graph Theory +5

Rows per page

1–5 of 116