Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface |
scientific article |
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
