Colouring random geometric graphs

MaRDI QIDQ3576649zbMATH OpenFDO

Authors Tobias Müller, Colin McDiarmid

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0101/0.html

zbMATH Keywords

chromatic numbergraph coloringclique numberrandom geometric graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the chromatic number of random geometric graphs
• Two-point concentration in random geometric graphs
• The distant-\(l\) chromatic number of random geometric graphs
• Clique colourings of geometric graphs
• Coloring geographical threshold graphs

Cited in

(12)

• Colouring Random Regular Graphs
• The distant-2 chromatic number of random proximity and random geometric graphs
• Coloring geographical threshold graphs
• Random colorings in manifolds
• Coloring geographical threshold graphs
• Two-point concentration in random geometric graphs
• The distant-\(l\) chromatic number of random geometric graphs
• Clique colourings of geometric graphs
• Scaling laws for maximum coloring of random geometric graphs
• The chromatic and clique numbers of random scaled sector graphs
• On the chromatic number of random geometric graphs
• On the clique number of noisy random geometric graphs

This page was built for publication: Colouring random geometric graphs

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