Transition operations over plane trees
From MaRDI portal
Publication:5918848
DOI10.1016/j.disc.2020.111929zbMath1441.05050arXiv1810.02839OpenAlexW2951531787MaRDI QIDQ5918848
Alexander Pilz, Ahad N. Zehmakan, Torrie L. Nichols, Csaba D. Tóth
Publication date: 8 June 2020
Published in: Discrete Mathematics, LATIN 2018: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02839
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Flipping plane spanning paths ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- The edge rotation graph
- Amortized efficiency of generating planar paths in convex position
- A quadratic distance bound on sliding between crossing-free spanning trees
- Flip distance between two triangulations of a point set is NP-complete
- Flips in planar graphs
- On the diameter of geometric path graphs of points in convex position
- Transforming spanning trees: A lower bound
- Transforming spanning trees and pseudo-triangulations
- Geometric tree graphs of points in convex position
- Analytic combinatorics of non-crossing configurations
- On the rotation distance of graphs
- Distances between graphs under edge operations
- Reconstruction of the path graph
- The dual diameter of triangulations
- Flipping edge-labelled triangulations
- Reverse search for enumeration
- Disjoint compatible geometric matchings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Bichromatic compatible matchings
- On the number of plane geometric graphs
- On planar path transformation
- Computing the flip distance between triangulations
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Compatible spanning trees
- Flip distance between triangulations of a planar point set is APX-hard
- The diameter of associahedra
- Counting Plane Graphs: Flippability and Its Applications
- Edge rotations and distance between graphs
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Short Encodings of Evolving Structures
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees
- Simultaneous diagonal flips in plane triangulations
- Sequences of spanning trees and a fixed tree theorem
This page was built for publication: Transition operations over plane trees
