Title of article :
On a Conjecture of Fan and Raspaud
Author/Authors :
M??ajov?، نويسنده , , Edita and ?koviera، نويسنده , , Martin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
We show that every bridgeless cubic graph having a 2-factor with at most two odd circuits admits three perfect matchings with no common edge. This partially verifies a conjecture of Fan and Raspaud (1994) and supports Fulkersonʹs conjecture (1971).
Keywords :
Cubic graph , Perfect matching , Fulkersonיs Conjecture
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
