Geometric tree graphs of points in convex position
From MaRDI portal
Publication:1289020
DOI10.1016/S0166-218X(99)00006-2zbMath0930.05032MaRDI QIDQ1289020
Ferran Hurtado, Marc Noy, Mercè Mora, Carmen Hernando, Alberto Márquez
Publication date: 24 May 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (23)
Reconstruction of the path graph ⋮ Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph ⋮ On planar path transformation ⋮ Unnamed Item ⋮ New production matrices for geometric graphs ⋮ Characteristic polynomials of production matrices for geometric graphs ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Amortized efficiency of generating planar paths in convex position ⋮ The biplanar tree graph ⋮ Unnamed Item ⋮ On maximal chains in the non-crossing partition lattice ⋮ Gray code enumeration of plane straight-line graphs ⋮ Flips in planar graphs ⋮ Production matrices for geometric graphs ⋮ Planar tree transformation: results and counterexample ⋮ On the diameter of geometric path graphs of points in convex position ⋮ Hamilton cycles in the path graph of a set of points in convex position ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ Transition operations over plane trees ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Transforming spanning trees: A lower bound ⋮ A new lower bound on the maximum number of plane graphs using production matrices ⋮ On local transformation of polygons with visibility properties.
Cites Work
This page was built for publication: Geometric tree graphs of points in convex position
