Search filters

List of works by Jaroslav Nešetřil

All those EPPA classes (strengthenings of the Herwig–Lascar theorem)

scientific article published in 2022

An extremal problem on v-partite graphs

scientific article published in September 1983

Antisymmetric flows and strong colourings of oriented graphs

scientific article published in 1999

Characterisations and examples of graph classes with bounded expansion

Colouring, constraint satisfaction, and complexity

article published in 2008

Every finite graph is a full subgraph of a rigid graph

scientific article published in December 1971

Finite presentation of homogeneous graphs, posets and Ramsey classes

scientific article published in December 2005

Grad and classes with bounded expansion II. Algorithmic aspects

Graph-indexed random walks on pseudotrees

Invitation to Discrete Mathematics

book by Jiří Matoušek and Jaroslav Nešetřil

More About Subcolorings

On Edge-maps whose Inverse Preserves Flows or Tensions

On Pisier type problems and results (Combinatorial Applications to Number Theory)

scientific article published in 1990

On the complexity of H-coloring

On the maximum average degree and the oriented chromatic number of a graph

scientific article published in August 1999

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

article published in 2001

Partitions of graphs into cographs

scientific article published in 2010

Path homomorphisms

scientific article published in August 1996

Ramsey classes and homogeneous structures

scientific article published in January 2005

Selectivity of hypergraphs

scientific article published in 1984

Sparsity

scientific article

The Erdős–Turán property for a class of bases

scientific article published in 2004

Vojtěch Jarnı́k's work in combinatorial optimization