Drawing partial 2-trees with few slopes

DOI10.1007/S00453-022-01065-0MaRDI QIDQ2701381zbMATH OpenOpenAlexFDO

Authors William Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat

Publication date 28 April 2023

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-022-01065-0

zbMATH Keywords

angular resolutionpartial 2-treesslope numbertight bounds

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Recommendations

• Planar and plane slope number of partial 2-trees
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• The planar slope number of planar partial 3-trees of bounded degree
• Drawings of planar graphs with few slopes and segments

Cites work

• h-quasi planar drawings of bounded treewidth graphs in linear area
• Algorithms and theory of computation handbook. Special topics and techniques.
• Area requirement of graph drawings with few crossings per edge
• Bounded-degree graphs can have arbitrarily large slope numbers
• Bounded-degree graphs have arbitrarily large geometric thickness
• Drawability of Complete Graphs Using a Minimal Slope Set
• Drawing Cubic Graphs with the Four Basic Slopes
• Drawing Graphs in the Plane with High Resolution
• Drawing outer 1-planar graphs with few slopes
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Drawings of planar graphs with few slopes and segments
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Graph Drawing
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 512936 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• On the Angular Resolution of Planar Graphs
• Outerplanar graph drawings with few slopes
• Planar and plane slope number of partial 2-trees
• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• The planar slope number of planar partial 3-trees of bounded degree

This page was built for publication: Drawing partial 2-trees with few slopes

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