Disjoint compatibility graph of non-crossing matchings of points in convex position, Electr. J. Comb, vol.22, issue.1, pp.1-65, 2015. ,
Compatible Geometric Matchings, Electronic Notes in Discrete Mathematics, vol.31, pp.6-7617, 2009. ,
DOI : 10.1016/j.endm.2008.06.040
Edge-removal and non-crossing configurations in geometric graphs, Discrete Mathematics & Theoretical Computer Science, vol.12, issue.1, pp.75-86, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00990435
Packing plane spanning trees and paths in complete geometric graphs, Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG, 2014. ,
Crossing-Free Subgraphs, Ann. Discrete Math, vol.12, pp.9-12, 1982. ,
DOI : 10.1016/S0304-0208(08)73484-4
Disjoint Simplices and Geometric Hypergraphs, Annals of the New York Academy of Sciences, vol.2, issue.1 Combinatorial, pp.1-3, 1989. ,
DOI : 10.2307/2305092
Disjoint edges in geometric graphs, Discrete & Computational Geometry, vol.53, issue.2, pp.287-290, 1989. ,
DOI : 10.1007/BF02187731
Graphs (in Hebrew) Gilyonot Lematematika, pp.2-8, 1966. ,
The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979. ,
DOI : 10.1016/0095-8956(79)90021-2
Partitions of complete geometric graphs into plane trees, Computational Geometry, vol.34, issue.2, pp.116-125, 2006. ,
DOI : 10.1016/j.comgeo.2005.08.006
A combinatorial survey of identities for the double factorial Geometric graphs with no three disjoint edges Noncrossing Hamiltonian paths in geometric graphs, Discrete & Computational Geometry Discrete Applied Mathematics, vol.34, issue.1559, pp.679-6951096, 2005. ,
Hamiltonicity in connected regular graphs, Information Processing Letters, vol.113, issue.22-24, pp.22-24858, 2013. ,
DOI : 10.1016/j.ipl.2013.08.005
Some Theorems on Abstract Graphs, Proceedings of the London Mathematical Society, pp.69-81, 1952. ,
DOI : 10.1112/plms/s3-2.1.69
On two lower bound constructions, Proceedings of the 11th Canadian Conference on Computational Geometry, 1999. ,
On Sets of Distances of n Points, The American Mathematical Monthly, vol.53, issue.5, pp.248-250, 1946. ,
DOI : 10.2307/2305092
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, 2004. ,
DOI : 10.1007/978-3-322-80303-0
Lower bounds on the number of crossing-free subgraphs of KN, Computational Geometry, vol.16, issue.4, pp.211-221, 2000. ,
DOI : 10.1016/S0925-7721(00)00010-9
Forcing Disjoint Segments in the Plane, European Journal of Combinatorics, vol.17, issue.4, pp.391-395, 1996. ,
DOI : 10.1006/eujc.1996.0032
On representatives of subsets, Journal of the London Mathematical Society, issue.1, pp.1-1026, 1935. ,
Graph theory, 1991. ,
Recursive generation of simple planar 5-regular graphs and pentangulations, Journal of Graph Algorithms and Applications, vol.15, issue.3, pp.417-436, 2011. ,
DOI : 10.7155/jgaa.00232
Applications of a semi-dynamic convex hull algorithm, BIT, vol.22, issue.3, pp.249-267, 1992. ,
DOI : 10.1007/BF01994880
Aufgabe no. 167, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.43, p.114, 1934. ,
Disjoint Compatible Geometric Matchings, Discrete & Computational Geometry, vol.36, issue.3, pp.89-131, 2013. ,
DOI : 10.1007/s00454-012-9466-9
On the smallest sets blocking simple perfect matchings in a convex geometric graph, Israel Journal of Mathematics, vol.6, issue.1, pp.465-484, 2012. ,
DOI : 10.1007/s11856-011-0090-9
Bounds on the number of disjoint spanning trees, Journal of Combinatorial Theory, Series B, vol.17, issue.2, pp.199-203, 1974. ,
DOI : 10.1016/0095-8956(74)90087-2
Extremal problems in combinatorial geometry, Aarhus University Lecture Notes Series, vol.53, 1979. ,
Algorithms for ham-sandwich cuts, Discrete & Computational Geometry, vol.61, issue.4, pp.433-452, 1994. ,
DOI : 10.1007/BF02574017
Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products, Bulletin of the American Mathematical Society, vol.54, issue.4, pp.352-360, 1948. ,
DOI : 10.1090/S0002-9904-1948-09002-4
Edge-disjoint spanning trees of finite graphs, Journal of the London Mathematical Society, vol.36, issue.1, pp.445-450, 1961. ,
Optimal crossing-free Hamiltonian circuit drawings of Kn, Journal of Combinatorial Theory, Series B, vol.29, issue.1, pp.13-26, 1980. ,
DOI : 10.1016/0095-8956(80)90041-6
Some geometric applications of Dilworth???s theorem, Discrete & Computational Geometry, vol.30, issue.1, pp.1-7, 1994. ,
DOI : 10.1007/BF02574361
Counting triangulations of planar point sets, Electr. J. Comb, vol.18, issue.1, 2011. ,
On the Number of Crossing???Free Matchings, Cycles, and Partitions, SIAM Journal on Computing, vol.36, issue.3, pp.695-720, 2006. ,
DOI : 10.1137/050636036
Maximum matchings in complete multipartite graphs, pp.6-16, 1996. ,
The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators, 2009. ,
Lösung der aufgabe 167, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.45, pp.33-35, 1935. ,
Note on Geometric Graphs, Journal of Combinatorial Theory, Series A, vol.89, issue.1, pp.126-132, 2000. ,
DOI : 10.1006/jcta.1999.3001
Geometric graphs with few disjoint edges, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.633-642, 1999. ,
DOI : 10.1145/276884.276905
Connected Factors, Journal of the London Mathematical Society, vol.1, issue.1, pp.221-230, 1961. ,
DOI : 10.1112/jlms/s1-36.1.221