Circular chromatic numbers of some distance graphs

DOI10.1016/j.disc.2005.02.004zbMath1063.05045MaRDI QIDQ1773363

Peter Che Bor Lam, Wensong Lin, Zeng Min Song

Publication date: 28 April 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.004

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Fractional chromatic number of distance graphs generated by two-interval sets, On the chromatic number of circulant graphs, The packing coloring of distance graphs \(D(k,t)\), Coloring of distance graphs with intervals as distance sets

Cites Work

• Colouring the real line
• Colouring prime distance graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Distance graphs and \(T\)-coloring
• Chromatic number of prime distance graphs
• The chromatic numbers of distance graphs
• Coloring of integer distance graphs
• Circular chromatic numbers of a class of distance graphs
• Circular chromatic numbers of distance graphs with distance sets missing multiples
• Coloring of distance graphs with intervals as distance sets
• Star chromatic number
• Star chromatic numbers and products of graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item