Perfect matchings with crossings

DOI10.1007/978-3-031-06678-8_4MaRDI QIDQ2169938zbMATH OpenOpenAlexFDO

Authors R. Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber, Oswin Aichholzer

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06678-8_4

zbMATH Keywords

combinatorial geometrycrossingsorder typesperfect matchings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Analytic combinatorics of chord and hyperchord diagrams with k crossings
• Counting polygon triangulations is hard
• Enumerating order types for small point sets with applications
• scientific article; zbMATH DE number 1241844 (Why is no real title available?)
• scientific article; zbMATH DE number 1504583 (Why is no real title available?)
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the number of plane geometric graphs
• Point sets with many non-crossing perfect matchings
• The clique problem in ray intersection graphs
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle

Cited in

(4)

• Perfect matchings in shadow colorings
• Touching perfect matchings and halving lines
• Perfect matchings with crossings
• New variants of perfect non-crossing matchings

This page was built for publication: Perfect matchings with crossings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169938)