Colouring proximity graphs in the plane

DOI10.1016/S0012-365X(98)00292-1zbMath0924.05024MaRDI QIDQ1297436

Bruce A. Reed, Colin J. H. McDiarmid

Publication date: 3 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberclique numberEuclidean distanceproximity graphfinite positive upper density

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (5)

Clique colourings of geometric graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ Distributed coloring and the local structure of unit-disk graphs ⋮ Worst-case analysis of a dynamic channel assignment strategy ⋮ Perfectness and imperfectness of unit disk graphs on triangular lattice points

Cites Work

• On sublattices of the hexagonal lattice
• Transversal theory. An account of some aspects of combinatorial mathematics
• Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
• Convex Bodies The Brunn-MinkowskiTheory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colouring proximity graphs in the plane