Packing plane perfect matchings into a point set

MaRDI QIDQ3455035zbMATH OpenFDO

Authors Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid

Publication date 3 December 2015

Full work available at URL https://arxiv.org/abs/1501.03686, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2758/0.html

zbMATH Keywords

geometric graphplane matchingpacking matching

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Point sets with many non-crossing perfect matchings
• Packing plane spanning trees into a point set
• Matching Points with Circles and Squares
• Matching colored points in the plane: Some new results

Cited in

(8)

• Packing 1-plane Hamiltonian cycles in complete geometric graphs
• A new text information extraction algorithm of video image under multimedia environment
• Point sets with many non-crossing perfect matchings
• Partitions of complete bipartite geometric graphs into plane perfect matchings
• Three edge-disjoint plane spanning paths in a point set
• Crossing-free perfect matchings in wheel point sets
• Packing plane spanning trees into a point set
• An upper bound on the size of separated matchings

This page was built for publication: Packing plane perfect matchings into a point set

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