Small grid drawings of planar graphs with balanced partition

DOI10.1007/s10878-011-9381-7zbMath1258.05029OpenAlexW2093327209MaRDI QIDQ695321

Takao Nishizeki, Xiao Zhou, Takashi Hikino

Publication date: 21 December 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9381-7

zbMATH Keywords

partitionplanar graphgrid drawingseries-parallel graph

Mathematics Subject Classification ID

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

Related Items

Universal point sets for planar three-trees ⋮ Drawing Planar Graphs with Reduced Height

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• How to draw a planar graph on a grid
• Small area drawings of outerplanar graphs
• Planar graphs: Theory and algorithms
• Small Grid Drawings of Planar Graphs with Balanced Bipartition
• Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• Drawing Planar Graphs on Area
• A Lower Bound on the Area Requirements of Series-Parallel Graphs
• Grid drawings of 4-connected plane graphs

This page was built for publication: Small grid drawings of planar graphs with balanced partition