Jaroslav Nešetřil

Research interests

Publications

• Sparsity

  Algorithms and combinatorics · 2012 · https://doi.org/10.1007/978-3-642-27875-4

• Sparsity (Graphs, Structures, and Algorithms)

  HAL (Le Centre pour la Communication Scientifique Directe) · 2012 · https://doi.org/10.1007/978-3-642-27875-4

• Grad and classes with bounded expansion I. Decompositions

  European Journal of Combinatorics · 2007 · https://doi.org/10.1016/j.ejc.2006.07.013

• Tree-depth, subgraph coloring and homomorphism bounds

  European Journal of Combinatorics · 2005 · https://doi.org/10.1016/j.ejc.2005.01.010

• Graphs and Homomorphisms

  Oxford University Press eBooks · 2004 · https://doi.org/10.1093/acprof:oso/9780198528173.001.0001

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

  Discrete Mathematics · 2001 · https://doi.org/10.1016/s0012-365x(00)00224-7

• The core of a graph

  Discrete Mathematics · 1992 · https://doi.org/10.1016/0012-365x(92)90282-k

• On the complexity of H-coloring

  Journal of Combinatorial Theory Series B · 1990 · https://doi.org/10.1016/0095-8956(90)90132-j

• On the complexity of the subgraph problem

  Czech digital mathematics library · 1985

Current projects

No projects listed.