Disjoint Compatible Geometric Matchings

Edge-Disjoint Spanning Trees of Finite Graphs

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 805 citations

Natural Sciences, Mathematics, Combinatorics +7

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

W. T. Tutte · Journal of the London Mathematical Society · 1961 · 669 citations

Natural Sciences, Computer Science, Mathematics +7

Lower bounds on the number of crossing-free subgraphs of KN

Alfredo Garcı́a, Marc Noy, Javier Tejel · Computational Geometry · 2000 · 111 citations

Natural Sciences, Computer Science, Mathematics +8

On the Number of Crossing‐Free Matchings, Cycles, and Partitions

Micha Sharir, Emo Welzl · SIAM Journal on Computing · 2006 · 80 citations

Natural Sciences, Computer Science, Combinatorics +10

Compatible geometric matchings

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu et al. · Computational Geometry · 2009 · 51 citations · Full text