Coloring geographical threshold graphs

MaRDI QIDQ5396740zbMATH OpenFDO

Authors Milan Bradonjić, Tobias Müller, Allon G. Percus

Publication date 3 February 2014

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

zbMATH Keywords

chromatic numberrandom geometric graphsgeographical threshold graphscoloring algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring geographical threshold graphs
• On the chromatic number of random geometric graphs
• Colouring random geometric graphs
• Coloring Random Intersection Graphs and Complex Networks
• The structure of geographical threshold graphs

Cited in

(8)

• Colouring Non-sparse Random Intersection Graphs
• On the mixing time of geographical threshold graphs
• Coloring geographical threshold graphs
• The structure of geographical threshold graphs
• Graphs with tunable chromatic numbers for parallel coloring
• Scaling laws for maximum coloring of random geometric graphs
• On the chromatic number of random geometric graphs
• COLORING SPATIAL GRAPHS

This page was built for publication: Coloring geographical threshold graphs

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