Circular chromatic numbers and fractional chromatic numbers of distance graphs
From MaRDI portal
Publication:1266350
DOI10.1006/eujc.1997.0199zbMath0905.05032OpenAlexW1998842318MaRDI QIDQ1266350
Xuding Zhu, Ling-ling Huang, Gerard Jennhwa Chang
Publication date: 16 September 1998
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1997.0199
Related Items (23)
Asymptotic clique covering ratios of distance graphs ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Some star extremal circulant graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ 4-colorable 6-regular toroidal graphs. ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ On Hamiltonian paths in distance graphs ⋮ Circular chromatic numbers of some distance graphs ⋮ Long cycles and paths in distance graphs ⋮ On the independence ratio of distance graphs ⋮ The circular chromatic number of the Mycielskian ofGdk ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ Connectivity and diameter in distance graphs ⋮ On the chromatic number of circulant graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Distance graphs and \(T\)-coloring ⋮ Planar graphs with circular chromatic numbers between 3 and 4
This page was built for publication: Circular chromatic numbers and fractional chromatic numbers of distance graphs