Disconnected matchings
From MaRDI portal
Publication:5925688
DOI10.1007/978-3-030-89543-3_48OpenAlexW4245055729MaRDI QIDQ5925688
Paulo Eustáquio Duarte Pinto, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Bruno Porto Masquio
Publication date: 30 March 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.09248
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parameterized complexity of the induced matching problem
- 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
- 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
