Thickness and Colorability of Geometric Graphs

DOI10.1007/978-3-642-45043-3_21zbMath1419.05071MaRDI QIDQ2864305

Debajyoti Mondal, Stephane Durocher, Ellen Gethner

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_21

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Thickness and colorability of geometric graphs, Note on \(k\)-planar crossing numbers