Asymptotic clique covering ratios of distance graphs

DOI10.1006/eujc.2001.0560zbMath1002.05054OpenAlexW1985876622MaRDI QIDQ1612760

Xuding Zhu, Daphne Der-Fen Liu

Publication date: 18 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/eafa06d5a9cf7ad3fa405a9cf942004fc67a919d

zbMATH Keywords

circular chromatic numberfractional chromatic number\(T\)-coloringsdistance graphsclique covering ratio

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• 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
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Distance graphs and \(T\)-coloring
• 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
• Star-extremal graphs and the lexicographic product
• An Asymptotic Approach to the Channel Assignment Problem
• Further Results on T-Coloring and Frequency Assignment Problems
• Integral distance graphs
• Star Extremal Circulant Graphs
• Sets of integers with missing differences
• Circular chromatic number: A survey

This page was built for publication: Asymptotic clique covering ratios of distance graphs