Geometric Thickness of Complete Graphs
From MaRDI portal
Publication:4511256
DOI10.7155/jgaa.00023zbMath0955.05028arXivmath/9910185OpenAlexW2235627538MaRDI QIDQ4511256
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Publication date: 14 December 2000
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9910185
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (26)
Ideal spatial graph configurations ⋮ Packing plane spanning trees and paths in complete geometric graphs ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Graph drawings with few slopes ⋮ On simultaneous planar graph embeddings ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ On \(k\)-planar crossing numbers ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Straight-line drawings of 1-planar graphs ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Geometric thickness in a grid ⋮ Planar projections of graphs ⋮ Thickness and colorability of geometric graphs ⋮ Extension of a theorem of Whitney ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Partitions of complete geometric graphs into plane trees ⋮ Layouts of Expander Graphs ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Bounds on the crossing resolution of complete geometric graphs ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric Thickness in a Grid of Linear Area
This page was built for publication: Geometric Thickness of Complete Graphs
