The complexity of decomposing a graph into a matching and a bounded linear forest (Q6988422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8035807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of decomposing a graph into a matching and a bounded linear forest |
scientific article; zbMATH DE number 8035807 |
Statements
The complexity of decomposing a graph into a matching and a bounded linear forest (English)
0 references
4 May 2025
0 references
computational complexity
0 references
graph decompositions
0 references
linear forests
0 references
NP-completeness
0 references
0 references
