Circular chromatic number of subgraphs

DOI10.1002/JGT.10127zbMATH Open1030.05048OpenAlexW4243260922MaRDI QIDQ4432769FDOQ4432769

Xuding Zhu, Hossein Hajiabolhassan

Publication date: 29 October 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10127

Recommendations

• scientific article; zbMATH DE number 2058681
• Circular chromatic number: A survey
• An analogue of Hajós' theorem for the circular chromatic number
• scientific article; zbMATH DE number 1782859
• Circular chromatic numbers of some distance graphs

zbMATH Keywords

critical graphscircular chromatic numbersubgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph Theory and Probability. II

Cited In (17)

• Circular chromatic number and graph minors
• Title not available (Why is that?)
• An analogue of Hajós' theorem for the circular chromatic number. II
• Circular chromatic number and Mycielski graphs
• On the circular chromatic number of graph powers
• Title not available (Why is that?)
• An analogue of Dirac's theorem on circular super-critical graphs
• Title not available (Why is that?)
• Circular chromatic number: A survey
• Nearly nowhere-zero \(r\)-flow graphs
• Title not available (Why is that?)
• The circular chromatic number of induced subgraphs
• On the circular chromatic number of circular partitionable graphs
• Multicoloring and Mycielski construction
• Circular chromatic Ramsey number
• Circular chromatic number of induced subgraphs of Kneser graphs
• Title not available (Why is that?)

This page was built for publication: Circular chromatic number of subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432769)