Maximum Induced Matchings in Grids

DOI10.1007/978-1-4614-5134-1_12zbMath1375.05219OpenAlexW197802037MaRDI QIDQ4596162

Ruxandra Marinescu-Ghemeci

Publication date: 30 November 2017

Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_12

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Some bounds on the maximum induced matching numbers of certain grids ⋮ The \(\text{v} \)-number of monomial ideals

Cites Work

• Induced matchings in bipartite graphs
• NP-completeness of some generalizations of the maximum matching problem
• Induced matchings
• Induced matchings in intersection graphs.
• Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
• Finding a maximum induced matching in weakly chordal graphs
• On maximum induced matchings in bipartite graphs
• New results on maximum induced matchings in bipartite graphs and beyond
• New results on induced matchings
• Maximum weight edge-constrained matchings
• Minimizing flow time in the wireless gathering problem