Drawing Cubic Graphs with the Four Basic Slopes

DOI10.1007/978-3-642-25878-7_25MaRDI QIDQ3223959zbMATH OpenOpenAlexFDO

Authors Padmini Mukkamala, Dömötör Pálvölgyi

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.1973

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: We show that every cubic graph can be drawn in the plane with straight-line edges using only the four basic slopes $0,pi/4,pi/2,3pi/4$. We also prove that four slopes have this property if and only if we can draw $K_4$ with them.

Recommendations

• Drawing Cubic Graphs with at Most Five Slopes
• Drawing cubic graphs with at most five slopes
• Graph drawings with few slopes
• Cubic Graphs Have Bounded Slope Parameter
• Cubic graphs have bounded slope parameter
• Graphs and cubes
• scientific article; zbMATH DE number 1239598
• Rectangular-radial drawings of cubic plane graphs
• Drawing subcubic planar graphs with four slopes and optimal angular resolution

Cites work

• A contribution to queens graphs: a substitution method
• A survey of known results and research areas for \(n\)-queens
• Bounded-degree graphs can have arbitrarily large slope numbers
• Bounded-degree graphs have arbitrarily large geometric thickness
• Cubic graphs have bounded slope parameter
• Drawability of Complete Graphs Using a Minimal Slope Set
• Drawing cubic graphs with at most five slopes
• Drawing Graphs with Right Angle Crossings
• Drawings of planar graphs with few slopes and segments
• Fast generation of regular graphs and construction of cages
• Geometric representation of cubic graphs with four directions
• Geometric Thickness of Complete Graphs
• Graph Drawing
• Graph treewidth and geometric thickness parameters
• Graphs that admit right angle crossing drawings
• scientific article; zbMATH DE number 5150168 (Why is no real title available?)
• scientific article; zbMATH DE number 1974116 (Why is no real title available?)
• On representations of some thickness-two graphs
• On the perspectives opened by right angle crossing drawings
• The geometric thickness of low degree graphs
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• The thickness of graphs: A survey
• Thickness and coarseness of graphs

Cited in

(19)

• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Upward planar drawings with three and more slopes
• Universal slope sets for 1-bend planar drawings
• Outerplanar graph drawings with few slopes
• Drawing cubic graphs with at most five slopes
• The maker-breaker largest connected subgraph game
• Drawing partial 2-trees with few slopes
• How to draw a Tait-colorable graph
• Valued Fields withKCommuting Derivations
• The planar slope number of planar partial 3-trees of bounded degree
• Drawing Cubic Graphs with at Most Five Slopes
• Cubic Graphs Have Bounded Slope Parameter
• Angular Resolutions: Around Vertices and Crossings
• Cubic planar graphs that cannot be drawn on few lines
• Upward planar drawings with two slopes
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Upward Planar Drawings with Three and More Slopes
• The Complexity of Angular Resolution

Describes a project that uses

Uses Software

• GENREG

This page was built for publication: Drawing Cubic Graphs with the Four Basic Slopes

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