Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning to three matchings of given size is NP-complete for bipartite graphs |
scientific article |
Statements
Partitioning to three matchings of given size is NP-complete for bipartite graphs (English)
0 references
5 February 2015
0 references
NP-completeness
0 references
disjoint matchings
0 references
bipartite graphs
0 references
partitioning
0 references
