论文部分内容阅读
3-edge-coloring of cubic graphs Let G be a bridgeless cubic graph.G is 3-edge-colorable if there is an edge-coloring c:E(G)→{1,2,3} such that each c-1(i) is a matching,for each i ∈ {1,2,3}.