Disconnected matchings
type: Item
instance of: scholarly article
title: Disconnected matchings
DOI: 10.1007/978-3-030-89543-3_48
author: Guilherme C. M. Gomes
author: Bruno Porto Masquio
author: Paulo E. D. Pinto
author: Vinícius F. dos Santos
author: Jayme L. Szwarcfiter
published in: Lecture Notes in Computer Science
publication date: 2023-03-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/2112.09248
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7670494
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
zbMATH Keywords: induced subgraphs
zbMATH Keywords: matchings
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4245055729
cites work: Degenerate matchings and edge colorings
cites work: Q5422499
cites work: Graph Classes: A Survey
cites work: Induced matchings
cites work: Q4414635
cites work: Q4551369
cites work: Parameterized Algorithms
cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs
cites work: Paths, Trees, and Flowers
cites work: Q4198056
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Generalized subgraph-restricted matchings in graphs
cites work: Uniquely restricted matchings
cites work: 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
cites work: On maximum induced matchings in bipartite graphs
cites work: The parameterized complexity of the induced matching problem
cites work: Acyclic Matching in Some Subclasses of Graphs
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: The complexity of satisfiability problems
cites work: Efficient enumeration of all minimal separators in a graph
description: scientific article; zbMATH DE number 7670494