Covers of Eulerian graphs

  • Authors:

  • Genghua Fan

  • Affiliations:

  • Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n-1/2⌋ circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980.