Geometric spanners with small chromatic number

DOI10.1016/j.comgeo.2008.04.003zbMath1160.05021OpenAlexW2004207893MaRDI QIDQ955227

Mathieu Couture, Paz Carmi, Prosenjit Bose, Norbert Zeh, Anil Maheshwari, Michiel H. M. Smid

Publication date: 19 November 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.04.003

zbMATH Keywords

geometric graphgeometric spannerscomputational geometryonline algorithm\(k\)-colorable graphsPaz graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains

Cites Work

• Unnamed Item
• Ordered theta graphs
• A short list color proof of Grötzsch's theorem
• Geometric Spanner Networks
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields

This page was built for publication: Geometric spanners with small chromatic number