Distance graphs with maximum chromatic number

DOI10.1016/j.disc.2007.07.061zbMath1136.05018MaRDI 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 number; distance graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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