Double covers of cubic graphs with oddness 4

  • Authors:
  • Roland Häggkvist;Sean McGuinness

  • Affiliations:
  • Department of Mathematics, University of Umeå, Umeå, Sweden;17 London Road, Syosset, NY

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles has a cycle double cover.