An analogue of Hajós' theorem for the circular chromatic number. II
From MaRDI portal
Publication:1409583
DOI10.1007/s00373-002-0505-9zbMath1030.05042MaRDI QIDQ1409583
Publication date: 16 October 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-002-0505-9
05C15: Coloring of graphs and hypergraphs
Related Items
Grassmann homomorphism and Hajós-type theorems, Hajós' theorem for list coloring, Minimal circular-imperfect graphs of large clique number and large independence number, An analogue of Hajós’ Theorem for the circular chromatic number