Approximation of 3-Edge-Coloring of Cubic Graphs
References (8)
A cyclically 6-edge-connected snark of order 118
Discrete Math.
(1996)Superposition and constructions of graphs without nowhere-zero k-flows
European J. Combin.
(2002)- et al.
Edge coloring of multigraphs
Discrete Math.
(2005) - et al.
Computers and Intractability
(1979)
There are more references available in the full text version of this article.
Cited by (0)
- 1
This work was supported by grants APVT-51-027604 and VEGA 2/7037/7.
Copyright © 2007 Elsevier B.V. All rights reserved.