Circular chromatic numbers of distance graphs with distance sets missing multiples
From MaRDI portal
Publication:1971805
DOI10.1006/eujc.1999.0284zbMath0939.05035MaRDI 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
Related Items
Circular chromatic numbers of Mycielski's graphs, Distance graphs and \(T\)-coloring, Some star extremal circulant graphs, Circular chromatic numbers of some distance graphs, Coloring of distance graphs with intervals as distance sets, Proof of a conjecture on fractional Ramsey numbers
Cites Work
- Unnamed Item
- Unnamed Item
- 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