Colouring proximity graphs in the plane

DOI10.1016/S0012-365X(98)00292-1zbMATH Open0924.05024MaRDI QIDQ1297436FDOQ1297436

Authors: Colin McDiarmid, Bruce Reed 

Publication date: 3 November 1999

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

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

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)

Cites Work

• Convex Bodies The Brunn-MinkowskiTheory
• Transversal theory. An account of some aspects of combinatorial mathematics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On sublattices of the hexagonal lattice
• Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem

Cited In (9)

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