Distance graphs and \(T\)-coloring

zbMath0930.05037MaRDI QIDQ1305534

Xuding Zhu, Gerard Jennhwa Chang, Daphne Der-Fen Liu

Publication date: 30 January 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

circular chromatic numberfractional chromatic numberchromatic numberdistance graph\(T\)-coloring ratio

Mathematics Subject Classification ID

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

Related Items (13)

Asymptotic clique covering ratios of distance graphs ⋮ The vertex linear arboricity of distance graphs ⋮ A new approach for scheduling independent tasks with multiple modes ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Circular chromatic numbers of some distance graphs ⋮ On the independence ratio of distance graphs ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ Coloring of distance graphs with intervals as distance sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• Pattern periodic coloring of distance graphs
• \(T\)-colorings of graphs: recent results and open problems
• Unsolved problems in geometry
• \(T\)-colorings of 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
• \(T\)-graphs and the channel assignment problem
• The chromatic numbers of distance graphs
• Sequences of integers with missing differences
• Coloring of integer distance graphs
• Circular chromatic numbers of distance graphs with distance sets missing multiples
• An Asymptotic Approach to the Channel Assignment Problem
• Star chromatic number
• Star chromatic numbers and products of graphs
• Further Results on T-Coloring and Frequency Assignment Problems
• Integral distance graphs
• Fractional colorings with large denominators
• The fractional chromatic number of infinite graphs
• Sets of integers with missing differences

This page was built for publication: Distance graphs and \(T\)-coloring