On classes of minimal circular-imperfect graphs
From MaRDI portal
Publication:2482095
DOI10.1016/J.DAM.2007.05.045zbMATH Open1151.05025OpenAlexW4362104906MaRDI QIDQ2482095FDOQ2482095
Arnaud Pêcher, Annegret K. Wagler
Publication date: 16 April 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.045
Recommendations
Cites Work
- Title not available (Why is that?)
- Sur le coloriage des graphs
- The ellipsoid method and its consequences in combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- On certain polytopes associated with graphs
- A characterization of perfect graphs
- The strong perfect graph theorem
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Title not available (Why is that?)
- Circular perfect graphs
- Perfect zero–one matrices
- Star chromatic number
- Title not available (Why is that?)
- Circular chromatic number: A survey
- A note on the star chromatic number
- Graphical properties related to minimal imperfection
- Minimally circular-imperfect graphs with a major vertex
- Minimal circular-imperfect graphs of large clique number and large independence number
- Title not available (Why is that?)
Cited In (9)
- Triangle-free strongly circular-perfect graphs
- Circular-imperfection of triangle-free graphs
- On circular critical graphs
- Some aspects of minimal imperfect graphs
- A circle criterion for a generalized cross graph in terms of minimal excluded minors
- Grinstead's conjecture is true for graphs with a small clique number
- On circular-perfect graphs: a survey
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Claw‐free circular‐perfect graphs
This page was built for publication: On classes of minimal circular-imperfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482095)
