#### Filter Results:

- Full text PDF available (116)

#### Publication Year

1971

2017

- This year (6)
- Last 5 years (41)
- Last 10 years (95)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Pavol Hell, Jaroslav Nesetril
- J. Comb. Theory, Ser. B
- 1990

- Jaroslav Nesetril, Patrice Ossona de Mendez
- Eur. J. Comb.
- 2008

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width… (More)

- Jaroslav Nesetril, Patrice Ossona de Mendez
- Algorithms and combinatorics
- 2012

- Jaroslav Nesetril, Patrice Ossona de Mendez
- Eur. J. Comb.
- 2006

- Jaroslav Nesetril, Claude Tardif
- J. Comb. Theory, Ser. B
- 2000

We provide a correspondence between the subjects of duality and density in classes of finite relational structures. The purpose of duality is to characterise the structures C that do not admit a homomorphism into a given target B by the existence of a homomorphism from a structure A into C. Density is the order-theoretic property of containing no covers (or… (More)

- Jaroslav Nesetril, Vojtech Rödl
- J. Comb. Theory, Ser. A
- 1977

- Jaroslav Nesetril, Ales Pultr
- Discrete Mathematics
- 1978

- Jaroslav Nesetril, Eva Milková, Helena Nesetrilová
- Discrete Mathematics
- 2001

Bor uvka presented in 1926 the /rst solution of the Minimum Spanning Tree Problem (MST) which is generally regarded as a cornerstone of Combinatorial Optimization. In this paper we present the /rst English translation of both of his pioneering works. This is followed by the survey of development related to the MST problem and by remarks and historical… (More)

- Jaroslav Nesetril, Xuding Zhu
- Journal of Graph Theory
- 1996

- Jaroslav Nesetril, Patrice Ossona de Mendez
- Eur. J. Comb.
- 2008

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). These classes are also characterized by the existence of several partition results such as the existence of low… (More)