Colouring proximity graphs in the plane

DOI10.1016/S0012-365X(98)00292-1MaRDI QIDQ1297436zbMATH OpenFDO

Authors Colin McDiarmid, Bruce Reed

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)

Recommendations

• Random channel assignment in the plane
• Colouring random geometric graphs
• On the chromatic number of random geometric graphs
• On the graph of large distances
• scientific article; zbMATH DE number 4118392

Cites work

• scientific article; zbMATH DE number 446693 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• Convex Bodies The Brunn-MinkowskiTheory
• Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
• On sublattices of the hexagonal lattice
• Transversal theory. An account of some aspects of combinatorial mathematics

Cited in

(11)

• Coloring of G²-G, for Euclidesian graph G
• Worst-case analysis of a dynamic channel assignment strategy
• Random channel assignment in the plane
• Improper colouring of (random) unit disk graphs
• Perfectness and imperfectness of unit disk graphs on triangular lattice points
• Stationary map coloring
• Fractional and \(j\)-fold coloring of the plane
• Graph imperfection. I
• Clique colourings of geometric graphs
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
• Distributed coloring and the local structure of unit-disk graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297436)