Covering the edges of a graph by three odd subgraphs

Abstract

We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge-disjoint covering by three odd subgraphs is not possible. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 77–82, 2006