On the smallest sets blocking simple perfect matchings in a convex geometric graph
From MaRDI portal
Publication:1758986
DOI10.1007/s11856-011-0090-9zbMath1253.05114arXiv0911.3350OpenAlexW1989343971MaRDI QIDQ1758986
Publication date: 19 November 2012
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.3350
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Characterization of co-blockers for simple perfect matchings in a convex geometric graph ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Flip graphs, Yoke graphs and diameter ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of odd order ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Disjoint edges in geometric graphs ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of even order
Cites Work
This page was built for publication: On the smallest sets blocking simple perfect matchings in a convex geometric graph
