The following pages link to J. Nešetřil (Q175596):
Displaying 50 items.
- Two proofs of the Ramsey property of the class of finite hypergraphs (Q1835932) (← links)
- A note on maxflow-mincut and homomorphic equivalence in matroids (Q1840660) (← links)
- Duality theorems for finite structures (characterising gaps and good characterisations) (Q1850486) (← links)
- Colored homomorphisms of colored mixed graphs (Q1850491) (← links)
- Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\) (Q1850625) (← links)
- Density via duality. (Q1853500) (← links)
- High girth and extendability (Q1918540) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- The origins of minimal spanning tree algorithms -- Borůvka and Jarník (Q1946015) (← links)
- Aspects of structural combinatorics. (Graph homomorphisms and their use) (Q1970083) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) (Q2326661) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- Fractal property of the graph homomorphism order (Q2403692) (← links)
- Limits of mappings (Q2403694) (← links)
- Bowtie-free graphs have a Ramsey lift (Q2413002) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- On tension-continuous mappings (Q2427549) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Ramsey classes of topological and metric spaces (Q2433752) (← links)
- A note on Fiedler value of classes with sublinear separators (Q2435377) (← links)
- Flow-continuous mappings -- the influence of the group (Q2441642) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- Folding (Q2498742) (← links)
- On the number of \(B\)-flows of a graph (Q2509755) (← links)
- Homomorphisms of derivative graphs (Q2549328) (← links)
- A congruence theorem for asymmetric trees (Q2549698) (← links)
- Every finite graph is a full subgraph of a rigid graph (Q2550402) (← links)
- On critical uniquely colorable graphs (Q2552509) (← links)
- On symmetric and antisymmetric relations (Q2556417) (← links)
- Representing monoids by mappings preserving equivalences (Q2558913) (← links)
- Cuts and bounds (Q2575795) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Structural sparsity (Q2815673) (← links)
- Contractors for flows (Q2838942) (← links)
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness'' (Q2851468) (← links)
- Counting homomorphisms to sparse graphs (Q2851494) (← links)
- Contractors for flows (Q2857376) (← links)
- When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741) (← links)
- Linear time low tree-width partitions and algorithmic consequences (Q2931403) (← links)
- Book Review: Large networks and graph limits (Q2933831) (← links)
