Triangle-free strongly circular-perfect graphs
From MaRDI portal
Publication:1025560
DOI10.1016/j.disc.2007.12.101zbMath1229.05109OpenAlexW2038047973MaRDI QIDQ1025560
Arnaud Pêcher, Sylvain Coulonges, Annegret K. Wagler
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.101
Related Items (6)
Claw‐free circular‐perfect graphs ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ On circular-perfect graphs: a survey ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs ⋮ On strongly circular-perfectness
Cites Work
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- The complexity of determining a shortest cycle of even length
- Geometric algorithms and combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- On classes of minimal circular-imperfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Convex-round graphs are circular-perfect
- A note on the star chromatic number
- Star chromatic number
- Circular perfect graphs
This page was built for publication: Triangle-free strongly circular-perfect graphs
