Complexity of deciding the equality of matching numbers
From MaRDI portal
Cites work
- Acyclic Matching in Some Subclasses of Graphs
- Degenerate matchings and edge colorings
- Disconnected matchings
- Disconnected matchings
- 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
- Generalized subgraph-restricted matchings in graphs
- Graph Classes: A Survey
- Graph theory
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1953189 (Why is no real title available?)
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- Induced Matching in Some Subclasses of Bipartite Graphs
- Induced matchings
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs
- Maximum induced matching of hexagonal graphs
- Maximum induced matchings for chordal graphs in linear time
- NP-completeness of some generalizations of the maximum matching problem
- On maximum induced matchings in bipartite graphs
- On some hard and some tractable cases of the maximum acyclic matching problem
- On the approximability of the maximum induced matching problem
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number
- Parameterized algorithms
- Paths, Trees, and Flowers
- The graphs with maximum induced matching and maximum matching the same size
- The parameterized complexity of the induced matching problem
- Uniquely restricted matchings
This page was built for publication: Complexity of deciding the equality of matching numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845958)
