On the Number of Crossing‐Free Matchings, Cycles, and Partitions
From MaRDI portal
Publication:3446814
Recommendations
- Point sets with many non-crossing perfect matchings
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Crossing-free perfect matchings in wheel point sets
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
Cited in
(45)- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Point sets with many non-crossing perfect matchings
- Linear transformation distance for bichromatic matchings
- Colored ray configurations
- Disjoint compatible geometric matchings
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- On numbers of pseudo-triangulations
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- Perfect matchings with crossings
- Parameterized analysis and crossing minimization problems
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Counting polygon triangulations is hard
- Structural properties of bichromatic non-crossing matchings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Counting triangulations and other crossing-free structures approximately
- Counting triangulations and other crossing-free structures via onion layers
- On the number of plane geometric graphs
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers
- Matching edges and faces in polygonal partitions
- Configurations of non-crossing rays and related problems
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting plane graphs with exponential speed-up
- Special frequency quadrilaterals and an application
- Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
- Convex polygons in geometric triangulations
- Packing plane perfect matchings into a point set
- On the number of crossing-free partitions
- Crossings in grid drawings
- scientific article; zbMATH DE number 4123124 (Why is no real title available?)
- scientific article; zbMATH DE number 1241844 (Why is no real title available?)
- Crossing-free perfect matchings in wheel point sets
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
- On Compatible Matchings
- Packing 1-plane Hamiltonian cycles in complete geometric graphs
- Connecting the dots (with minimum crossings)
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Untangling planar graphs from a specified vertex position-Hard cases
- Convex Polygons in Geometric Triangulations
- An upper bound for the number of rectangulations of a planar point set
- Perfect matchings with crossings
- Interview with Micha Sharir
- Noncrossing partition lattices from planar configurations
- Crossing and independent families among polygons
- Flips in planar graphs
This page was built for publication: On the Number of Crossing‐Free Matchings, Cycles, and Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3446814)
