An analogue of Hajós' theorem for the circular chromatic number. II
From MaRDI portal
Publication:1409583
DOI10.1007/S00373-002-0505-9zbMATH Open1030.05042OpenAlexW2020733172MaRDI QIDQ1409583FDOQ1409583
Authors: Xuding Zhu 
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
Recommendations
- An analogue of Hajós' theorem for the circular chromatic number
- Hajós theorem for colorings of edge-weighted graphs
- Recent developments in circular colouring of graphs
- The circular chromatic number of induced subgraphs
- scientific article; zbMATH DE number 5063041
- Chromatic numbers in some graphs
- Graphs whose circular chromatic number equals the chromatic number
- Circular chromatic number of subgraphs
- scientific article; zbMATH DE number 1782859
- scientific article; zbMATH DE number 2058681
Cited In (9)
- Hajós-type constructions and neighborhood complexes
- Hajós' theorem for list coloring
- Grassmann homomorphism and Hajós-type theorems
- Hajós-like theorem for group coloring
- Minimal circular-imperfect graphs of large clique number and large independence number
- Hajós theorem for colorings of edge-weighted graphs
- An analogue of Hajós' theorem for the circular chromatic number
- A higher chromatic analogue of the image of \(J\)
- How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm
This page was built for publication: An analogue of Hajós' theorem for the circular chromatic number. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1409583)
