Coloring of distance graphs with intervals as distance sets
From MaRDI portal
Publication:2567207
DOI10.1016/j.ejc.2004.01.017zbMath1082.05038OpenAlexW2004322923MaRDI QIDQ2567207
Wensong Lin, Peter Che Bor Lam
Publication date: 29 September 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.017
Related Items
On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Circular chromatic numbers of some distance graphs ⋮ On the independence ratio of distance graphs ⋮ Sequences of integers with three missing separations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Colouring prime distance graphs
- Pattern periodic coloring of 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 some distance graphs
- Circular chromatic numbers of a class of distance graphs
- Circular chromatic numbers of distance graphs with distance sets missing multiples
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- Integral distance graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Circular chromatic number: A survey
This page was built for publication: Coloring of distance graphs with intervals as distance sets
