Circular chromatic numbers of distance graphs with distance sets missing multiples

DOI10.1006/eujc.1999.0284zbMath0939.05035OpenAlexW1996932435MaRDI QIDQ1971805

Gerard Jennhwa Chang, Ling-ling Huang

Publication date: 29 June 2000

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/99c1725c0564f2380b203505e784079dc478243a

zbMATH Keywords

circular chromatic numberchromatic numberdistance graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (6)

Some star extremal circulant graphs ⋮ Proof of a conjecture on fractional Ramsey numbers ⋮ Circular chromatic numbers of some distance graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Distance graphs and \(T\)-coloring

Cites Work

• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Circular chromatic numbers of Mycielski's graphs
• Distance graphs and \(T\)-coloring
• Chromatic number of prime distance graphs
• The chromatic numbers of distance graphs
• Coloring of integer distance graphs
• A note on the star chromatic number
• Star chromatic number
• The circular chromatic number of the Mycielskian ofGdk
• Integral distance graphs

This page was built for publication: Circular chromatic numbers of distance graphs with distance sets missing multiples