An analogue of Hajós’ Theorem for the circular chromatic number
From MaRDI portal
Publication:2723478
DOI10.1090/S0002-9939-01-05908-1zbMath0971.05042MaRDI QIDQ2723478
Publication date: 5 July 2001
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Related Items (5)
Hajós' theorem for list coloring ⋮ Hajós-like theorem for signed graphs ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ Resource-sharing system scheduling and circular chromatic number
Cites Work
- Unnamed Item
- Weakly triangulated graphs
- Graphs whose circular chromatic number equals the chromatic number
- Graphs whose every independent set has a common neighbour
- Planar graphs with circular chromatic numbers between 3 and 4
- An analogue of Hajós' theorem for the circular chromatic number. II
- Star chromatic numbers of graphs
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- The star chromatic number of a graph
- The Homomorphism Structure of Classes of Graphs
- A simple proof of Moser's theorem
- On the Structure of Dense Triangle-Free Graphs
- Acyclic graph coloring and the complexity of the star chromatic number
- The star-chromatic number of planar graphs
- Circular chromatic number: A survey
This page was built for publication: An analogue of Hajós’ Theorem for the circular chromatic number
