The following pages link to J. Nešetřil (Q175596):
Displaying 50 items.
- Many Facets of Dualities (Q2971613) (← links)
- (Q3043730) (← links)
- On Ramsey-type positional games (Q3057062) (← links)
- (Q3078211) (← links)
- (Q3096706) (← links)
- Some examples of universal and generic partial orders (Q3118387) (← links)
- (Q3127640) (← links)
- (Q3155420) (← links)
- Note on projective graphs (Q3159392) (← links)
- On first-order definable colorings (Q3194868) (← links)
- Two Proofs in Combinatorial Number Theory (Q3222279) (← links)
- Approximations of Mappings (Q3295272) (← links)
- (Q3298208) (← links)
- (Q3317148) (← links)
- (Q3325761) (← links)
- (Q3331232) (← links)
- (Q3331250) (← links)
- (Q3348944) (← links)
- On Pisier type problems and results (combinatorial applications to number theory) (Q3348966) (← links)
- Noncrossing Subgraphs in Topological Layouts (Q3357538) (← links)
- Homomorphism-Homogeneous Relational Structures (Q3373659) (← links)
- (Q3377512) (← links)
- (Q3392747) (← links)
- (Q3400702) (← links)
- Density of universal classes of series-parallel graphs (Q3418730) (← links)
- (Q3424774) (← links)
- Constraint Satisfaction with Countable Homogeneous Templates (Q3430949) (← links)
- A note on Random Homomorphism from ArbitraryGraphs to Z (Q3438977) (← links)
- The Grad of a Graph and Classes with Bounded Expansion (Q3439315) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- A Probabilistic Approach to the Dichotomy Problem (Q3446822) (← links)
- A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems (Q3466342) (← links)
- (Q3496356) (← links)
- Small Diameters of Duals (Q3503222) (← links)
- NP for Combinatorialists (Q3503495) (← links)
- On Finite Maximal Antichains in the Homomorphism Order (Q3503497) (← links)
- Homomorphisms and Polynomial Invariants of Graphs (Q3503516) (← links)
- Finite duality for some minor closed classes (Q3503522) (← links)
- Generalised Dualities and Finite Maximal Antichains (Q3522939) (← links)
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565) (← links)
- NP by Means of Lifts and Shadows (Q3525566) (← links)
- (Q3539818) (← links)
- (Q3539854) (← links)
- (Q3567810) (← links)
- (Q3576698) (← links)
- Structural Properties of Sparse Graphs (Q3601929) (← links)
- (Q3606132) (← links)
- (Q3615792) (← links)
- (Q3671222) (← links)
- On some problems related to partitions of edges of a graph (Q3672042) (← links)
