Disconnected matchings
From MaRDI portal
Publication:5972267
DOI10.1016/j.tcs.2023.113821OpenAlexW4324387296MaRDI QIDQ5972267
Paulo Eustáquio Duarte Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Guilherme C. M. Gomes, Bruno Porto Masquio
Publication date: 26 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113821
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Editing graphs to satisfy degree constraints: a parameterized approach
- Parameterized complexity of finding regular induced subgraphs
- The parameterized complexity of the induced matching problem
- Maximum matchings and trees
- Induced matchings
- Efficient enumeration of all minimal separators in a graph
- Degenerate matchings and edge colorings
- 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
- On maximum induced matchings in bipartite graphs
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Parameterized algorithms and kernels for almost induced matching
- Graph minors. II. Algorithmic aspects of tree-width
- Graph Classes: A Survey
- Acyclic Matching in Some Subclasses of Graphs
- Paths, Trees, and Flowers
- The complexity of satisfiability problems
- Parameterized Algorithms
- A Characterization of Comparability Graphs and of Interval Graphs
- Uniquely restricted matchings
This page was built for publication: Disconnected matchings
