Title of article :
Circuits of length 5 in 2-factors of cubic graphs
Author/Authors :
Lukot’ka، نويسنده , , R. and M??ajov?، نويسنده , , E. and Maz?k، نويسنده , , J. and ?koviera، نويسنده , , M.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
Abstract :
For every even integer n ≥ 28 we construct a cyclically 4-edge-connected snark of order n which has girth 5 and contains a 5-circuit in every 2-factor. In addition, for every given positive integer k , we construct a nontrivial snark having at least k 5-circuits in every 2-factor.
Keywords :
2-factor , snark , 5-circuit , 5-cycle , Circuit
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
