Graphs whose circular chromatic number equals the chromatic number

DOI10.1007/s004930050050zbMath0929.05025OpenAlexW2072295012MaRDI QIDQ1125613

Xuding Zhu

Publication date: 8 December 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050050

zbMATH Keywords

chromatic number of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Strengthening topological colorful results for graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Planar graphs with circular chromatic numbers between 3 and 4 ⋮ Minimally circular-imperfect graphs with a major vertex ⋮ Convex-round graphs are circular-perfect