Complexity of approximation of 3-edge-coloring of graphs (Q975462): 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.ipl.2008.05.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004299695 / rank | |||
Normal rank | |||
Revision as of 23:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of approximation of 3-edge-coloring of graphs |
scientific article |
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
