Clique and chromatic number of circular-perfect graphs

DOI10.1016/J.ENDM.2010.05.026zbMATH Open1237.90245OpenAlexW2007206992MaRDI QIDQ2883567FDOQ2883567

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

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

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)

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• On certain polytopes associated with graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Circular perfect graphs
• Star chromatic number
• Title not available (Why is that?)
• 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

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
• Colouring clique-hypergraphs of circulant graphs
• On the theta number of powers of cycle graphs
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Title not available (Why is that?)
• 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)