Distance graphs with maximum chromatic number

DOI10.1016/j.disc.2007.07.061zbMath1136.05018OpenAlexW2083949378MaRDI QIDQ2476275

Oriol Serra, Javier Barajas

Publication date: 18 March 2008

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

Full work available at URL: https://hal.inria.fr/hal-01184347/file/dmAE0134.pdf

zbMATH Keywords

chromatic numberdistance graphs

Mathematics Subject Classification ID

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

Related Items (10)

Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ On the chromatic number of integral circulant graphs ⋮ Packing chromatic number of distance graphs ⋮ Solving lonely runner conjecture through differential geometry ⋮ On packing colorings of distance graphs ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ On the independence ratio of distance graphs ⋮ Density of sets with missing differences and applications ⋮ On the chromatic number of circulant graphs

Cites Work

• Colouring the real line
• Colouring prime distance graphs
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• The chromatic numbers of distance graphs
• On planarity and colorability of circulant graphs
• 4-colorable 6-regular toroidal graphs.
• Distance graphs with finite chromatic number
• Fractional chromatic number and circular chromatic number for distance graphs with large clique size
• Integral distance graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Chromatic numbers of integer distance graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance graphs with maximum chromatic number