Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs

DOI10.1007/S00454-010-9310-ZzbMath1251.05111OpenAlexW2001019475MaRDI QIDQ629832

Therese C. Biedl

Publication date: 10 March 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-010-9310-z

zbMATH Keywords

planar graphsouterplanar graphsgraph drawingseries-parallel graphs2-outerplanar graphspartial 3-treesvisibility representations

Mathematics Subject Classification ID

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

Related Items (15)

Outer 1-planar graphs ⋮ Drawing Halin-graphs with small height ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Area requirement of graph drawings with few crossings per edge ⋮ Drawing outer-1-planar graphs revisited ⋮ Splitting plane graphs to outerplanarity ⋮ Parameterized approaches to orthogonal compaction ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Homotopy height, grid-major height and graph-drawing height ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ Universal point sets for planar three-trees ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ The partial visibility representation extension problem ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth ⋮ Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Area-efficient planar straight-line drawings of outerplanar graphs
• On the parameterized complexity of layered graph drawing
• Small area drawings of outerplanar graphs
• On the two-dimensional orthogonal drawing of series-parallel graphs
• Drawing planar graphs using the canonical ordering
• Bemerkungen zum Vierfarbenproblem
• New Lower Bounds For Orthogonal Drawings
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
• A Lower Bound on the Area Requirements of Series-Parallel Graphs
• Layout of Graphs with Bounded Tree-Width
• Convex Maps
• Grid drawings of 4-connected plane graphs

This page was built for publication: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs