Drawing graphs on two and three lines

DOI10.1007/3-540-36151-0_4MaRDI QIDQ4422260zbMATH OpenFDO

Authors Sabine Cornelsen, Thomas Schank, Dorothea Wagner

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280031.htm

Mathematics Subject Classification ID

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

Recommendations

• Drawing Graphs on Two and Three Lines
• An algorithm for straight-line drawing of planar graphs
• Drawing Bipartite Graphs on Two Curves
• Drawing a tree on parallel lines
• Cubic planar graphs that cannot be drawn on few lines

Cited in

(8)

• Computing straight-line 3D grid drawings of graphs in linear volume
• \(k\)-spine, 1-bend planarity
• Upright drawings of graphs on three layers
• Drawing Graphs on Two and Three Lines
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Compact grid representation of graphs
• On rectangle intersection graphs with stab number at most two
• Curve-constrained drawings of planar graphs

This page was built for publication: Drawing graphs on two and three lines

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