Maximum Induced Matchings in Grids

DOI10.1007/978-1-4614-5134-1_12zbMATH Open1375.05219OpenAlexW197802037MaRDI QIDQ4596162FDOQ4596162

Authors: 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

Recommendations

• On maximum induced matching numbers of special grids
• Some bounds on the maximum induced matching numbers of certain grids
• Maximum induced matchings in graphs
• Maximum induced matchings close to maximum matchings
• Induced matchings in graphs of bounded maximum degree
• On maximum induced matchings in bipartite graphs
• The Maximum Number of Dominating Induced Matchings
• Maximum induced matching of hexagonal graphs

Mathematics Subject Classification ID

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

Cites Work

• Induced matchings in bipartite graphs
• Induced matchings
• On maximum induced matchings in bipartite graphs
• NP-completeness of some generalizations of the maximum matching problem
• 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
• New results on maximum induced matchings in bipartite graphs and beyond
• New results on induced matchings
• Induced matchings in intersection graphs.
• Finding a maximum induced matching in weakly chordal graphs
• Minimizing flow time in the wireless gathering problem
• Maximum weight edge-constrained matchings

Cited In (11)

• Some bounds on the maximum induced matching numbers of certain grids
• The conditions of a matching being induced
• On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
• On maximum induced matching numbers of special grids
• Induced matchings in intersection graphs
• The Maximum Number of Dominating Induced Matchings
• Squares of Intersection Graphs and Induced Matchings
• Maximum induced matchings in graphs
• A note on the NP-hardness of two matching problems in induced subgrids
• The \(\text{v} \)-number of monomial ideals
• A characterization of well-indumatchable graphs having girth greater than seven

This page was built for publication: Maximum Induced Matchings in Grids

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