On strong 1-factors and Hamilton weights of cubic graphs (Q5931416)

Let \(\langle K_4\rangle\) be the set of all cubic graphs obtained from \(K_4\) by a series of contractions of triangles to vertices and extensions of vertices into triangles. A 1-factor \(M\) of a cubic graph \(G\) is strong if \(|M\cap T|=1\) for each 3-edge-cut \(T\) of \(G\). In the paper it is proved that a cubic graph \(G\) has precisely three strong 1-factors if and only if \(G\) is in \(\langle K_4\rangle\). Consequently, \(G\) admits a Hamiltonian weight and is uniquely edge-3-colourable.