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

DOI10.1016/J.IPL.2007.10.015zbMATH Open1186.68334OpenAlexW1974761963MaRDI QIDQ963353FDOQ963353

Authors: Zvi Lotker, J. Díaz, Maria Serna 

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

Recommendations

• The distant-\(l\) chromatic number of random geometric graphs
• On the chromatic number of random geometric graphs
• On the chromatic number of random subgraphs of a certain distance graph
• New upper bound for the chromatic number of a random subgraph of a distance graph
• Colouring random geometric graphs

zbMATH Keywords

graph algorithmsrandom graphscoloringcombinatorial problemsdistant-2 coloring

Mathematics Subject Classification ID

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

Cites Work

• Random Geometric Graphs
• Combinatorial Geometry and Graph Theory
• Title not available (Why is that?)
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of a planar graph
• Connectivity of random k-nearest-neighbour graphs
• The chromatic and clique numbers of random scaled sector graphs

Cited In (2)

• Colouring Non-sparse Random Intersection Graphs
• The distant-\(l\) chromatic number of random geometric graphs

This page was built for publication: The distant-2 chromatic number of random proximity and random geometric graphs

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