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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.06.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013427304 / rank | |||
Normal rank | |||
Revision as of 22:07, 19 March 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
