On graphs with induced matching number almost equal to matching number
From MaRDI portal
Publication:324703
Recommendations
- Number of induced matchings of graphs
- Graphs with maximal induced matchings of the same size
- Induced matching numbers of finite graphs and edge ideals
- The graphs with maximum induced matching and maximum matching the same size
- Induced matchings in graphs of bounded maximum degree
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
- Induced matchings, maximal IM-extendable graphs and induced matching number
- Induced matchings in bipartite graphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- Publication:4944970
Cites work
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- 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
- Induced matchings
- Matching theory
- NP-completeness of some generalizations of the maximum matching problem
- New results on maximum induced matchings in bipartite graphs and beyond
- On maximum induced matchings in bipartite graphs
- Parameterized complexity of finding regular induced subgraphs
- The graphs with maximum induced matching and maximum matching the same size
- The parameterized complexity of the induced matching problem
Cited in
(2)
This page was built for publication: On graphs with induced matching number almost equal to matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324703)
