Convex-round graphs are circular-perfect
From MaRDI portal
Publication:3150195
DOI10.1002/jgt.10047zbMath1006.05054OpenAlexW4229847238MaRDI QIDQ3150195
Jing Huang, Jörgen Bang-Jensen
Publication date: 9 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10047
Related Items (6)
Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ On circular-perfect graphs: a survey ⋮ On minimally circular-imperfect graphs ⋮ Triangle-free strongly circular-perfect graphs ⋮ Minimally circular-imperfect graphs with a major vertex
Cites Work
- The core of a graph
- Graphs whose circular chromatic number equals the chromatic number
- Graphs whose every independent set has a common neighbour
- Normal hypergraphs and the perfect graph conjecture
- A note on the star chromatic number
- Star chromatic number
- On the Structure of Dense Triangle-Free Graphs
- Convex-Round and Concave-Round Graphs
- Circular chromatic number: A survey
This page was built for publication: Convex-round graphs are circular-perfect
