Planar tree transformation: results and counterexample
From MaRDI portal
Publication:975528
DOI10.1016/j.ipl.2008.09.005zbMath1191.68459OpenAlexW1969338258WikidataQ124977496 ScholiaQ124977496MaRDI QIDQ975528
Kamrul Islam, Selim G. Akl, Henk G. Meijer
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.005
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Related Items (2)
Amortized efficiency of generating planar paths in convex position ⋮ On the diameter of geometric path graphs of points in convex position
Cites Work
- Flips in planar graphs
- Geometric tree graphs of points in convex position
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Generating rooted triangulations without repetitions
- On local transformation of polygons with visibility properties.
- Reverse search for enumeration
- On planar path transformation
- Transforming triangulations
- On connectivities of tree graphs
This page was built for publication: Planar tree transformation: results and counterexample
