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

DOI10.1016/J.IPL.2007.10.015MaRDI QIDQ963353zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of a planar graph
• Combinatorial Geometry and Graph Theory
• Connectivity of random k-nearest-neighbour graphs
• Random Geometric 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)