Bounded-degree graphs have arbitrarily large geometric thickness
From MaRDI portal
Publication:2583678
zbMath1080.05063arXivmath/0509150MaRDI QIDQ2583678
János Barát, David R. Wood, Ji{ří} Matoušek
Publication date: 17 January 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0509150
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (25)
Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Geometric representation of cubic graphs with four directions ⋮ Graph drawings with few slopes ⋮ Drawings of planar graphs with few slopes and segments ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ Universal slope sets for 1-bend planar drawings ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Crossings in grid drawings ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ Drawing partial 2-trees with few slopes ⋮ Outerplanar graph drawings with few slopes ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Planar projections of graphs ⋮ Thickness and colorability of geometric graphs ⋮ Drawing cubic graphs with at most five slopes ⋮ On dispersable book embeddings ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Bounds on the crossing resolution of complete geometric graphs ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ On dispersability of some products of cycles
This page was built for publication: Bounded-degree graphs have arbitrarily large geometric thickness
