\(\varepsilon\)-unit distance graphs

DOI10.1007/s00454-004-1092-8zbMath1055.05048OpenAlexW1985636664MaRDI QIDQ1764171

Geoffrey Exoo

Publication date: 23 February 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-1092-8

Mathematics Subject Classification ID

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

Related Items (9)

Fractional meanings of nonrepetitiveness ⋮ Fractional and \(j\)-fold coloring of the plane ⋮ First non-trivial upper bound on circular chromatic number of the plane ⋮ Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ On the chromatic number of an infinitesimal plane layer ⋮ Coloring distance graphs on the plane ⋮ Upper bound on the circular chromatic number of the plane ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ Finite $\epsilon$-unit distance graphs

This page was built for publication: \(\varepsilon\)-unit distance graphs