Well-indumatched pseudoforests
From MaRDI portal
Publication:6657223
DOI10.1016/j.dam.2024.09.018MaRDI QIDQ6657223
Sibel Özkan, Didem Gözüpek, Yasemin Büyükçolak
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
matchinginduced matchingunicyclicstrong matchingpseudoforestsgood pendant edgepseudotreeswell-indumatched
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Graphs with maximal induced matchings of the same size
- Irredundancy in circular arc graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Maximum induced matchings for chordal graphs in linear time
- 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
- On the approximability of the maximum induced matching problem
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- New results on induced matchings
- A characterization of well-indumatchable graphs having girth greater than seven
- Bipartite Domination and Simultaneous Matroid Covers
- Well-indumatched Trees and Graphs of Bounded Girth
This page was built for publication: Well-indumatched pseudoforests
