Title: Decomposing graphs into rooted odd trails
|Affiliation:||University of Waterloo|
We give a precise characterization of when the edge set of a graph can be partitioned into k trails so that every trail begins and ends at a specified vertex v and has an odd number of edges.
Joint work with Jim Geelen and Paul Wollan.
200 University Avenue West
Waterloo, ON N2L 3G1