On the diameter of geometric path graphs of points in convex position
From MaRDI portal
Publication:976134
Recommendations
Cites work
- A quadratic distance bound on sliding between crossing-free spanning trees
- Distances between graphs under edge operations
- Flips in planar graphs
- Geometric tree graphs of points in convex position
- Hamilton cycles in the path graph of a set of points in convex position
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- On planar path transformation
- Planar tree transformation: results and counterexample
- Reverse search for enumeration
- Sequences of spanning trees and a fixed tree theorem
Cited in
(6)- Hamilton cycles in the path graph of a set of points in convex position
- Flipping plane spanning paths
- Short flip sequences to untangle segments in the plane
- On the connectedness and diameter of a geometric Johnson graph
- Reconstruction of the path graph
- Amortized efficiency of generating planar paths in convex position
This page was built for publication: On the diameter of geometric path graphs of points in convex position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976134)