On circular-perfect graphs: a survey
From MaRDI portal
Publication:2225429
DOI10.1016/j.ejc.2020.103224zbMath1458.05087OpenAlexW3081683860MaRDI QIDQ2225429
Annegret K. Wagler, Arnaud Pêcher
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103224
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Topics on perfect graphs
- The strong perfect graph theorem
- On minimally circular-imperfect graphs
- Triangle-free strongly circular-perfect graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- On certain polytopes associated with graphs
- Polynomial time computability of some graph parameters for superclasses of perfect graphs
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- Minimal circular-imperfect graphs of large clique number and large independence number
- On the theta number of powers of cycle graphs
- On classes of minimal circular-imperfect graphs
- On rank-perfect subclasses of near-bipartite graphs
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Anti-blocking polyhedra
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Some results on circular perfect graphs and perfect graphs
- Convex-round graphs are circular-perfect
- Three classes of minimal circular-imperfect graphs
- A note on the star chromatic number
- Circular-imperfection of triangle-free graphs
- Star chromatic number
- Star chromatic numbers and products of graphs
- On the Shannon capacity of a graph
- Circular perfect graphs
- Density of the circular chromatic numbers of series-parallel graphs
- Perfect zero–one matrices
- Reducibility among Combinatorial Problems
- Beyond Perfection: Computational Results for Superclasses
- Blocking and anti-blocking pairs of polyhedra
- Sur le coloriage des graphs
- Claw‐free circular‐perfect graphs
- Circular chromatic number: A survey
This page was built for publication: On circular-perfect graphs: a survey
