Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
Cun‐Quan Zhang · Journal of Graph Theory · 1995
Abstract A (1,2)‐eulerian weight w of a grph is hamiltonian if every faithful cover of w is a set of two Hamilton circuits. Let G be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if G admits a hamiltonian weight then G is uniquely 3‐edge‐colorable. © 1996 John Wiley & Sons, Inc.