Combinatorial Gray codes-an updated survey
T Mütze - ar** non-crossing spanning trees
For a set P of n points in general position in the plane, the flip graph F (P) has a vertex for
each noncrossing spanning tree on P and an edge between any two spanning trees that can …
each noncrossing spanning tree on P and an edge between any two spanning trees that can …
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito… - ar** plane spanning paths
O Aichholzer, K Knorr, W Mulzer, J Obenaus… - … and Workshops on …, 2023 - Springer
Let S be a planar point set in general position, and let be the set of all plane straight-line
paths with vertex set S. A flip on a path is the operation of replacing an edge e of P with …
paths with vertex set S. A flip on a path is the operation of replacing an edge e of P with …
Reconfiguration of plane trees in convex geometric graphs
A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges
pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip …
pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip …
Reconfiguration of non-crossing spanning trees
For a set $ P $ of $ n $ points in the plane in general position, a non-crossing spanning tree
is a spanning tree of the points where every edge is a straight-line segment between a pair …
is a spanning tree of the points where every edge is a straight-line segment between a pair …
On the chromatic number of some flip graphs
On the Chromatic Number of some Flip Graphs Page 1 Discrete Mathematics and Theoretical
Computer Science DMTCS vol. 11:2, 2009, 47–56 On the Chromatic Number of some Flip …
Computer Science DMTCS vol. 11:2, 2009, 47–56 On the Chromatic Number of some Flip …