An analogue of Hajós' theorem for the circular chromatic number. II

DOI10.1007/S00373-002-0505-9MaRDI QIDQ1409583zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

circular chromatic numberHajos' Theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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)

• How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm
• Hajós-type constructions and neighborhood complexes
• Grassmann homomorphism and Hajós-type theorems
• Hajós' theorem for list coloring
• 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

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)