论文信息 - Covering the edges of a graph by three odd subgraphs

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. c © ??? John Wiley & Sons, Inc.

Tamás Mátrai

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

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

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

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

[5] D. Y. Kesel'man,et al. Covering the edges of a graph by circuits , 1987 .

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

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

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

[9] Ciping Chen,et al. Odd and Even Factors of Graphs with Given Properties , 1991 .