Oct 27, 2023 · Abstract:A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross.

Let C be a set of n points in the plane in convex position. A spanning tree T on the set of points C is a subset of edges that forms a connected acyclic graph ...

Oct 31, 2023 · Abstract. A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross.

Jun 6, 2024 · We prove that there always exists a flip sequence between any pair of non-crossing spanning trees T₁,T₂ of length at most c n where c ≈ 1.95.

Mar 13, 2024 · Reconfiguration of plane trees in convex geometric graphs. We prove Theorem 3.1 by induction. Let TI,TF be two trees on a convex point set C, ...

Nov 23, 2023 · Two solutions A and B of a problem P. Can we transform A into B via a sequence of elementary steps while keeping solutions of P all along?

Mar 13, 2024 · Two geometric objects A and B. Can we transform A into B via a sequence of flips (keeping the same kind of geomertic objects all along) ?

Short Abstract This project concerns combinatorial problems at the interplay between graphs and discrete structures in the areas of discrete and ...

Reconfiguration of plane trees in convex geometric graphs. N Bousquet, L De Meyer, T Pierron, A Wesolek. arXiv preprint arXiv:2310.18518, 2023. 3, 2023 ; Maximum ...