Title of article
Fulkerson’s Conjecture and Loupekine snarks
Author/Authors
Karam، نويسنده , , Kaio and Campos، نويسنده , , C.N.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
9
From page
20
To page
28
Abstract
In 1976, F. Loupekine created a method for constructing new snarks from already known ones. In the present work, we consider an infinite family of Loupekine snarks constructed from the Petersen Graph and verify Fulkerson’s Conjecture for this family. In addition, we show that the technique used in the proof can be applied to families constructed from snarks other than the Petersen Graph. As an example, we extend the main result to Loupekine snarks constructed from the generalised Blanuša snarks.
Keywords
Perfect matching , edge-colouring , Fulkerson’s conjecture , Loupekine snarks
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600658
Link To Document