Clique and chromatic number of circular-perfect graphs

DOI10.1016/J.ENDM.2010.05.026MaRDI QIDQ2883567zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

polytopecircular-perfect graphcircular-clique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Computing clique and chromatic number of circular-perfect graphs in polynomial time
• On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
• Polynomial time computability of some graph parameters for superclasses of perfect graphs
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Computing the clique number of \(a\)-perfect graphs in polynomial time

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 1455118 (Why is no real title available?)
• scientific article; zbMATH DE number 969115 (Why is no real title available?)
• A note on the star chromatic number
• Circular perfect graphs
• 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
• Star chromatic number
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(10)

• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Polynomial time computability of some graph parameters for superclasses of perfect graphs
• On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs
• The balanced connected subgraph problem for geometric intersection graphs
• On the theta number of powers of cycle graphs
• Colouring clique-hypergraphs of circulant graphs
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• scientific article; zbMATH DE number 7024788 (Why is no real title available?)
• Computing clique and chromatic number of circular-perfect graphs in polynomial time

This page was built for publication: Clique and chromatic number of circular-perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883567)