On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes |
scientific article; zbMATH DE number 7883885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes |
scientific article; zbMATH DE number 7883885 |
Statements
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (English)
0 references
19 July 2024
0 references
packing problem
0 references
parameterized complexity
0 references
sparse graph
0 references
