On the circular chromatic number of circular partitionable graphs

DOI10.1002/jgt.20164zbMath1100.05038OpenAlexW4256706908MaRDI QIDQ5486280

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

zbMATH Keywords

circular coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Claw-free circular-perfect graphs ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs

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