Fractional chromatic number of distance graphs generated by two-interval sets

DOI10.1016/j.ejc.2007.09.007zbMath1246.05058OpenAlexW2014243372MaRDI QIDQ942143

Xuding Zhu, Daphne Der-Fen Liu

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.09.007

Mathematics Subject Classification ID

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

Related Items (11)

Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Packing chromatic number of distance graphs ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ On packing colorings of distance graphs ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Sequences of integers with three missing separations ⋮ Density of sets with missing differences and applications ⋮ Unnamed Item ⋮ Maximal density of integral sets with missing differences and the kappa values

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Chromatic number of prime distance graphs
• The channel assignment problem for mutually adjacent sites
• Sequences of integers with missing differences
• Coloring of integer distance graphs
• Circular chromatic numbers of some distance graphs
• Circular chromatic numbers of a class of distance graphs
• Coloring of distance graphs with intervals as distance sets
• Fractional chromatic number and circular chromatic number for distance graphs with large clique size
• An Asymptotic Approach to the Channel Assignment Problem
• Integral distance graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Sets of integers with missing differences
• Chromatic numbers of integer distance graphs

This page was built for publication: Fractional chromatic number of distance graphs generated by two-interval sets