|
Organizers |
On 3-path decompositions of planar bipartite graphs
by
Rui Xu
University of West Georgia
In 1985, Junger et al (and also in 2006, Barat and Thomassen) proposed the following open problem: is it true that every planar 2-edge-connected bipartite graph, whose size is divisible by 3, has a 3-path decomposition? I reduce this problem to the family of planar 2-edge-connected bipartite graph which are subdivisions of simple cubic graphs.
Date received: April 24, 2009
Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-39.