The distant-2 chromatic number of random proximity and random geometric graphs

DOI10.1016/j.ipl.2007.10.015zbMath1186.68334OpenAlexW1974761963MaRDI QIDQ963353

Zvi Lotker, Maria J. Serna, Josep Diaz

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.015

zbMATH Keywords

random graphscombinatorial problemsgraph algorithmscoloringdistant-2 coloring

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Colouring Non-sparse Random Intersection Graphs

Cites Work

• Unnamed Item
• The chromatic and clique numbers of random scaled sector graphs
• A bound on the chromatic number of the square of a planar graph
• Random Geometric Graphs
• Connectivity of random k-nearest-neighbour graphs
• Coloring the square of a planar graph
• Combinatorial Geometry and Graph Theory