A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Covering the edges of a graph by three odd subgraphs
2006
Journal of Graph Theory
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.
doi:10.1002/jgt.20170
fatcat:doh4bxbg75aj5af6wg7aksaka4