Drawing cubic graphs with at most five slopes

DOI10.1016/J.COMGEO.2007.05.003MaRDI QIDQ2483558zbMATH OpenOpenAlexFDO

Authors Balázs Keszegh, János Pach, 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)

Review text

In the paper it is proved that every graph with maximum degree 3 has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if every component has at least one vertex of degree less than 3, then four directions suffice.

Recommendations

• Drawing Cubic Graphs with at Most Five Slopes
• Drawing Cubic Graphs with the Four Basic Slopes
• Graph drawings with few slopes
• Drawings of planar graphs with few slopes and segments
• Drawing Graphs on Few Lines and Few Planes
• Drawing graphs on few lines and few planes
• Cubic Graphs Have Bounded Slope Parameter
• Cubic graphs have bounded slope parameter

Cites work

• Bounded-degree graphs can have arbitrarily large slope numbers
• Bounded-degree graphs have arbitrarily large geometric thickness
• Drawability of Complete Graphs Using a Minimal Slope Set
• Drawing Cubic Graphs with at Most Five Slopes
• Drawings of planar graphs with few slopes and segments
• Graph Drawing
• Graph drawings with few slopes
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 2145231 (Why is no real title available?)
• On Diagrams Representing Maps
• The geometric thickness of low degree graphs

Cited in

(13)

• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• Outerplanar graph drawings with few slopes
• Optimal 3D angular resolution for low-degree graphs
• Drawing Cubic Graphs with the Four Basic Slopes
• Cubic graphs have bounded slope parameter
• Valued Fields withKCommuting Derivations
• Drawing Cubic Graphs with at Most Five Slopes
• Cubic Graphs Have Bounded Slope Parameter
• Upward Planar Drawings with Three and More Slopes
• Level-planar drawings with few slopes
• Level-planar drawings with few slopes
• Bounds on the crossing resolution of complete geometric graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483558)