Complexity of approximation of 3-edge-coloring of graphs (Q975462)
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: Complexity of approximation of 3-edge-coloring of graphs |
scientific article; zbMATH DE number 5719189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of approximation of 3-edge-coloring of graphs |
scientific article; zbMATH DE number 5719189 |
Statements
Complexity of approximation of 3-edge-coloring of graphs (English)
0 references
9 June 2010
0 references
edge-coloring of graphs
0 references
NP-completeness
0 references
approximation algorithms
0 references
cyclical edge-connectivity
0 references
0.968090295791626
0 references
0.8087736964225769
0 references
0.8030334115028381
0 references
0.8013716340065002
0 references
0.7959506511688232
0 references
