Drawing cubic graphs with at most five slopes

DOI10.1016/j.comgeo.2007.05.003zbMath1154.05020OpenAlexW2104402629MaRDI QIDQ2483558

János Pach, Balázs Keszegh, Dömötör Pálvölgyi, Géza Tóth

Publication date: 28 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/129258/files/Keszegh_2008_Computational-Geometry.pdf

zbMATH Keywords

enumerationmaximum degreeslope numberStraight-line drawing

Mathematics Subject Classification ID

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

Related Items (8)

Upward Planar Drawings with Three and More Slopes ⋮ Minimum-segment convex drawings of 3-connected cubic plane graphs ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ Outerplanar graph drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Bounds on the crossing resolution of complete geometric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph drawings with few slopes
• Drawings of planar graphs with few slopes and segments
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Drawability of Complete Graphs Using a Minimal Slope Set
• Drawing Cubic Graphs with at Most Five Slopes
• The geometric thickness of low degree graphs
• Graph Drawing
• On Diagrams Representing Maps

This page was built for publication: Drawing cubic graphs with at most five slopes