Some results on circular chromatic number of a graph

zbMATH Open1174.05377MaRDI QIDQ5320274FDOQ5320274

Authors: Jianzhuan Wu, Wensong Lin 

Publication date: 22 July 2009

Recommendations

• Circular chromatic number: A survey
• The circular chromatic number of induced subgraphs
• On the circular chromatic number of circular partitionable graphs
• Circular colouring and graph homomorphism
• Circular chromatic numbers of Mycielski's graphs

zbMATH Keywords

circular chromatic number\((k,d)\)-coloringMycielski's graph\(r\)-circular-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Circular chromatic numbers of some distance graphs
• Circular chromatic numbers of some reduced Kneser graphs
• Graphs whose circular clique number equals the clique number
• The circular chromatic index of some Class 2 graphs
• On the circular chromatic number of deleted vertex subgraphs
• The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
• On the chromatic number of circulant graphs
• On the circular chromatic number of circular partitionable graphs
• An analogue of Hajós' theorem for the circular chromatic number
• A method to obtain lower bounds for circular chromatic number

This page was built for publication: Some results on circular chromatic number of a graph

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