Title of article
On even cycle decompositions of 4-regular line graphs
Author/Authors
M??ajov?، نويسنده , , Edita and Maz?k، نويسنده , , J?n، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
3
From page
1697
To page
1699
Abstract
We prove that the Petersen colouring conjecture implies a conjecture of Markstrِm saying that the line graph of every bridgeless cubic graph is decomposable into cycles of even length. In addition, we describe two infinite families of 4-regular graphs: the first family consists of 3-connected graphs with no even cycle decomposition and the second one consists of 4-connected signed graphs with no even cycle decomposition.
Keywords
Cubic graph , Signed graph , Line graph , Even cycle decomposition , Petersen colouring conjecture
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600385
Link To Document