Journal of Combinatorial Theory Series A
Lower bounds on the number of crossing-free subgraphs of KN
Computational Geometry: Theory and Applications
A better upper bound on the number of triangulations of a planar point set
Journal of Combinatorial Theory Series A
Information Processing Letters
Random triangulations of planar point sets
Proceedings of the twenty-second annual symposium on Computational geometry
On the Number of Crossing-Free Matchings, Cycles, and Partitions
SIAM Journal on Computing
Noncrossing Hamiltonian paths in geometric graphs
Discrete Applied Mathematics
On the Number of Plane Geometric Graphs
Graphs and Combinatorics
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs
Computational Geometry: Theory and Applications
On the chromatic number of some geometric type Kneser graphs
Computational Geometry: Theory and Applications
Long Non-crossing Configurations in the Plane
Discrete & Computational Geometry
Counting plane graphs: flippability and its applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Proceedings of the twenty-eighth annual symposium on Computational geometry
Long Non-Crossing Configurations In The Plane
Fundamenta Informaticae
On the number of cycles in planar graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Counting plane graphs: cross-graph charging schemes
GD'12 Proceedings of the 20th international conference on Graph Drawing
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
This column is devoted to non-crossing configurations in the plane realized with straight line segments connecting pairs of points from a finite ground set. Graph classes of interest realized in this way include matchings, spanning trees, spanning cycles, and triangulations. We review some problems and results in this area. At the end we list some open problems.