On graphs with induced matching number almost equal to matching number
From MaRDI portal
Publication:324703
DOI10.1016/J.ENDM.2015.07.003zbMATH Open1347.05155OpenAlexW2206694218MaRDI QIDQ324703FDOQ324703
Authors: Marcio Antônio Duarte, Felix Joos, Dieter Rautenbach, Uéverton dos Santos Souza, Lucia Draque Penso 
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.003
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
Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Parameterized complexity of finding regular induced subgraphs
- Title not available (Why is that?)
- Induced matchings
- On maximum induced matchings in bipartite graphs
- The parameterized complexity of the induced matching problem
- 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
- The graphs with maximum induced matching and maximum matching the same size
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)
