On the computational complexity of the bipartizing matching problem (Q2675722)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of the bipartizing matching problem |
scientific article |
Statements
On the computational complexity of the bipartizing matching problem (English)
0 references
26 September 2022
0 references
graph modification problems
0 references
edge bipartization
0 references
defective coloring
0 references
planar graphs
0 references
NP-completeness
0 references
parameterized complexity
0 references
0 references
0 references
