Well-indumatched pseudoforests
From MaRDI portal
Publication:6657223
Recommendations
- Well-indumatched Trees and Graphs of Bounded Girth
- Graphs with maximal induced matchings of the same size
- A characterization of well-indumatchable graphs having girth greater than seven
- scientific article; zbMATH DE number 3957168
- The structure of well-covered graphs and the complexity of their recognition problems
Cites work
- [/wiki/Item:Q3139292 scientific article; zbMATH DE number 434499 (Why is no real title available?)]
- A characterization of well-indumatchable graphs having girth greater than seven
- Approximability results for the maximum and minimum maximal induced matching problems
- Bipartite Domination and Simultaneous Matroid Covers
- Finding a maximum induced matching in weakly chordal 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
- Graphs with maximal induced matchings of the same size
- Induced matchings
- Induced matchings in intersection graphs.
- Irredundancy in circular arc graphs
- Maximum induced matchings for chordal graphs in linear time
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- On maximum induced matchings in bipartite graphs
- On the approximability of the maximum induced matching problem
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Well-indumatched Trees and Graphs of Bounded Girth
This page was built for publication: Well-indumatched pseudoforests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657223)
