Clique and chromatic number of circular-perfect graphs
From MaRDI portal
Publication:2883567
DOI10.1016/j.endm.2010.05.026zbMath1237.90245OpenAlexW2007206992MaRDI QIDQ2883567
Arnaud Pêcher, Annegret K. Wagler
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.026
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The balanced connected subgraph problem for geometric intersection graphs ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ On the theta number of powers of cycle graphs ⋮ Unnamed Item ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- On rank-perfect subclasses of near-bipartite graphs
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
- A note on the star chromatic number
- Star chromatic number
- Circular perfect graphs