The complexity of decomposing a graph into a matching and a bounded linear forest (Q6432350)
From MaRDI portal
scientific article; zbMATH DE number 900587089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of decomposing a graph into a matching and a bounded linear forest |
scientific article; zbMATH DE number 900587089 |
Statements
6 April 2023
0 references
cs.CC
0 references
math.CO
0 references
