Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422)
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: Approximating the maximum 2- and 3-edge-colorable subgraph problems |
scientific article; zbMATH DE number 5702673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the maximum 2- and 3-edge-colorable subgraph problems |
scientific article; zbMATH DE number 5702673 |
Statements
Approximating the maximum 2- and 3-edge-colorable subgraph problems (English)
0 references
28 April 2010
0 references
edge coloring of graphs
0 references
\(k\)-edge-colorable subgraph problem
0 references
approximation algorithm
0 references
