Connected matchings
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Erd?s problems and related topics of discrete geometry (52C10)
This page was built for publication: Connected matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964870)