Bounded-degree graphs can have arbitrarily large slope numbers

zbMath1080.05064MaRDI QIDQ2583679

János Pach, Dömötör Pálvölgyi

Publication date: 17 January 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125523

zbMATH Keywords

geometric graphsslope numberslope number of graphsstraight-line drawing of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Upward Planar Drawings with Three and More Slopes ⋮ 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 ⋮ Upward planar drawings with three and more slopes ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ Upward planar drawings with two slopes ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Crossings in grid drawings ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ On the Complexity of the Planar Slope Number Problem ⋮ 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 ⋮ 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