Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the maximum 2- and 3-edge-colorable subgraph problems |
scientific article |
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
