Cuts and bounds
From MaRDI portal
Publication:2575795
DOI10.1016/J.DISC.2004.07.034zbMATH Open1076.05089OpenAlexW1996104132MaRDI QIDQ2575795FDOQ2575795
J. Nešetřil, P. Ossona de Mendez
Publication date: 6 December 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.034
Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Algebraic combinatorics (05E99) Combinatorics of partially ordered sets (06A07) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Chromatically optimal rigid graphs
- On chromatic number of graphs and set-systems
- On chromatic number of finite set-systems
- Universal graphs with forbidden subgraphs and algebraic closure
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Regular graphs with no homomorphisms onto cycles
- The complexity of \(H\)-colouring of bounded degree graphs
- Colorings and homomorphisms of degenerate and bounded degree graphs
- On maximal finite antichains in the homomorphism order of directed graphs
- Universality of \(A\)-mote graphs
- Universal \(H\)-colorable graphs without a given configuration
- Random cubic graphs are not homomorphic to the cycle of size 7
Cited In (15)
- Many Facets of Dualities
- Finite duality for some minor closed classes
- Extended cuts
- Colouring, constraint satisfaction, and complexity
- Title not available (Why is that?)
- Cut for core logic
- Cut-Based Abduction
- Homomorphism order of connected monounary algebras
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Cut Admissibility by Saturation
- Title not available (Why is that?)
- Folding
- Cuts and gluts
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
This page was built for publication: Cuts and bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575795)
