Minimum-Area Drawings of Plane 3-Trees
From MaRDI portal
Publication:3168838
DOI10.7155/jgaa.00222zbMath1217.05074OpenAlexW2063063521MaRDI QIDQ3168838
Debajyoti Mondal, Md. Saidur Rahman, Md. Jawaherul Alam, Rahnuma Islam Nishat
Publication date: 19 April 2011
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233085
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Embedding stacked polytopes on a polynomial-size grid ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ An annotated review on graph drawing and its applications ⋮ Point-set embeddings of plane \(3\)-trees ⋮ On the edge-length ratio of planar graphs ⋮ On Upward Drawings of Trees on a Given Grid ⋮ Visibility drawings of plane 3-trees with minimum area ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Drawing Planar Graphs with Reduced Height
