Title of article
Approximation of 3-Edge-Coloring of Cubic Graphs
Author/Authors
Martin Kochol، نويسنده , , Martin and Krivo??kov?، نويسنده , , Nadʹa and Smejov?، نويسنده , , Silvia and ?rankov?، نويسنده , , Katar?na، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
91
To page
95
Abstract
The problem to find a 4-edge-coloring of a 3-regular graph is solvable in polynomial time but an analogous problem for 3-edge-coloring is NP-hard. We study complexity of approximation algorithms for invariants measuring how far is a 3-regular graph from having a 3-edge-coloring. We prove that it is an NP-hard problem to approximate such invariants by a power function with exponent smaller than 1.
Keywords
approximation algorithm , 3-regular graph , cyclical edge-connectivity , NP-Completeness , 3-edge-coloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454670
Link To Document