Covering the edges of a graph by three odd subgraphs

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

[1]  M. Kano,et al.  Some results on (1,f)-odd factors , 1999 .

[2]  Jerzy Topp,et al.  Odd factors of a graph , 1993, Graphs Comb..

[3]  Alex D. Scott.  On graph decompositions modulo k , 1997, Discret. Math..

[4]  Mikio Kano,et al.  Structure theorem and algorithm on (1, f)-odd subgraph , 2007, Discret. Math..

[5]  Mikio Kano,et al.  Odd subgraphs and matchings , 2002, Discret. Math..

[6]  Mikio Kano,et al.  Some results on odd factors of graphs , 1988, J. Graph Theory.

[7]  Atsushi Amahashi.  On factors with all degrees odd , 1985, Graphs Comb..