Note: small cycle cover of 2-connected cubic graphs

  • Authors:

  • Hong-Jian Lai;Xiangwen Li

  • Affiliations:

  • Department of Mathematics, West Virginia University, Morgantown, WV;Department of Mathematics and Statistics, University of Regina, Canada SK S4S 0A2

  • Venue:
  • Discrete Mathematics
  • Year:
  • 2003

Quantified Score

Hi-index 0.05

Visualization

Abstract

Every 2-connected simple cubic graph of order n ≥ 6 has a cycle cover with at most [n/4] cycles. This bound is best possible.