Point-Set Embeddings of Plane 3-Trees

DOI10.1007/978-3-642-18469-7_29zbMath1314.68236OpenAlexW1867161790MaRDI QIDQ3073682

Rahnuma Islam Nishat, Md. Saidur Rahman, Debajyoti Mondal

Publication date: 11 February 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_29

zbMATH Keywords

lower boundpoint-set embeddingplane 3-tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Embedding Plane 3-Trees in ℝ2 and ℝ3 ⋮ Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract) ⋮ Point-set embeddings of plane \(3\)-trees ⋮ A Note on Universal Point Sets for Planar Graphs

This page was built for publication: Point-Set Embeddings of Plane 3-Trees