Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513)
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: Parameterized complexity of \textsc{maximum edge colorable subgraph} |
scientific article; zbMATH DE number 7336139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of \textsc{maximum edge colorable subgraph} |
scientific article; zbMATH DE number 7336139 |
Statements
Parameterized complexity of \textsc{maximum edge colorable subgraph} (English)
0 references
21 April 2021
0 references
edge coloring
0 references
kernelization
0 references
FPT algorithms
0 references
kernel lower bound
0 references
