Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three

DOI10.1007/978-3-642-00219-9_40zbMath1213.68470OpenAlexW1536079361MaRDI QIDQ3611877

Muhammad Adnan, M.D. Abul Hassan Samee, Md. Jawaherul Alam, Md. Saidur Rahman

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_40

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Drawing plane triangulations with few segments ⋮ Minimum-segment convex drawings of 3-connected cubic plane graphs ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Drawings of planar graphs with few slopes and segments
• Bemerkungen zum Vierfarbenproblem
• Convex Maps
• Graph Drawing

This page was built for publication: Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three