Approximating the maximum 3-edge-colorable subgraph problem (Q1043590)
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 3-edge-colorable subgraph problem |
scientific article; zbMATH DE number 5644039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the maximum 3-edge-colorable subgraph problem |
scientific article; zbMATH DE number 5644039 |
Statements
Approximating the maximum 3-edge-colorable subgraph problem (English)
0 references
9 December 2009
0 references
approximation algorithm
0 references
edge-coloring
0 references
3-edge-coloring
0 references
Petersen graph
0 references
odd girth
0 references
