On the circular chromatic number of circular partitionable graphs

DOI10.1002/JGT.20164zbMATH Open1100.05038OpenAlexW4256706908MaRDI QIDQ5486280FDOQ5486280

Authors: Arnaud Pêcher, Xuding Zhu 

Publication date: 6 September 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20164

Recommendations

• Some results on circular chromatic number of a graph
• Circular colouring and graph homomorphism
• scientific article; zbMATH DE number 1228446
• scientific article; zbMATH DE number 1782859
• Circular chromatic number of subgraphs

zbMATH Keywords

circular coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
• On the circular chromatic number of deleted vertex subgraphs
• Grinstead's conjecture is true for graphs with a small clique number
• Claw-free circular-perfect graphs
• On the chromatic number of circulant graphs
• Some results on circular chromatic number of a graph

This page was built for publication: On the circular chromatic number of circular partitionable graphs

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