Drawing Graphs on Two and Three Lines

DOI10.7155/JGAA.00087MaRDI QIDQ3378491zbMATH OpenOpenAlexFDO

Authors Sabine Cornelsen, Thomas Schank, Dorothea Wagner

Publication date 3 April 2006

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/52328

zbMATH Keywords

linear-time algorithm

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1974105
• Drawing Bipartite Graphs on Two Curves
• An algorithm for straight-line drawing of planar graphs
• Cubic planar graphs that cannot be drawn on few lines
• Drawing Bipartite Graphs on Two Parallel Convex Curves

Cited in

(10)

• \(k\)-spine, 1-bend planarity
• Upright drawings of graphs on three layers
• Minimum-layer drawings of trees (extended abstract)
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• scientific article; zbMATH DE number 1974105 (Why is no real title available?)
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• Drawing Planar Graphs with Reduced Height
• 2-Layer Graph Drawings with Bounded Pathwidth
• Forbidden patterns in mixed linear layouts
• On the parameterized complexity of layered graph drawing

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 Q3378491)