Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768)
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 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface |
scientific article; zbMATH DE number 5810816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface |
scientific article; zbMATH DE number 5810816 |
Statements
Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (English)
0 references
5 November 2010
0 references
edge-coloring
0 references
orientable surface
0 references
polyhedral embedding
0 references
NP-complete problem
0 references
approximation algorithms
0 references
cyclical edge-connectivity
0 references
0 references
0.8703557848930359
0 references
0.8606077432632446
0 references
0.8462211489677429
0 references
0.8228974938392639
0 references
0.8013716340065002
0 references
