Drawing Cubic Graphs with the Four Basic Slopes

DOI10.1007/978-3-642-25878-7_25zbMath1311.68121arXiv1106.1973OpenAlexW1808317614MaRDI QIDQ3223959

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

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)

Related Items

Upward Planar Drawings with Three and More Slopes, 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, Universal slope sets for 1-bend planar drawings, The Complexity of Angular Resolution, The maker-breaker largest connected subgraph game, 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, Angular Resolutions: Around Vertices and Crossings

Uses Software

• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric representation of cubic graphs with four directions
• A survey of known results and research areas for \(n\)-queens
• The thickness of graphs: A survey
• On representations of some thickness-two graphs
• Graph treewidth and geometric thickness parameters
• Drawings of planar graphs with few slopes and segments
• Drawing cubic graphs with at most five slopes
• A contribution to queens graphs: a substitution method
• Thickness and coarseness of graphs
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Graphs that Admit Right Angle Crossing Drawings
• Drawing Graphs with Right Angle Crossings
• Cubic graphs have bounded slope parameter
• Drawability of Complete Graphs Using a Minimal Slope Set
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• Fast generation of regular graphs and construction of cages
• Geometric Thickness of Complete Graphs
• The geometric thickness of low degree graphs
• Graph Drawing
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• On the Perspectives Opened by Right Angle Crossing Drawings