The geometric thickness of low degree graphs
From MaRDI portal
Publication:5361688
DOI10.1145/997817.997868zbMath1374.68351arXivcs/0312056OpenAlexW2025485890WikidataQ57310374 ScholiaQ57310374MaRDI QIDQ5361688
Christian A. Duncan, Stephen G. Kobourov, David Eppstein
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0312056
graph drawingrectangle visibilitygeometric thicknessgraph thicknesslayered graphssimultaneous embeddings
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Geometric representation of cubic graphs with four directions ⋮ Graph drawings with few slopes ⋮ On simultaneous planar graph embeddings ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Characterization of unlabeled level planar trees ⋮ Planar projections of graphs ⋮ On the planar split thickness of graphs ⋮ Thickness and colorability of geometric graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Drawing cubic graphs with at most five slopes ⋮ Partitions of complete geometric graphs into plane trees ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Two trees which are self-intersecting when drawn simultaneously
