|
Organizers |
Selective k-factors in regular graphs
by
Robert Aldred
Dept. Mathematics & Statistics, University of Otago, Dunedin, N.Z.
Coauthors: Kenji Kimura
We consider some conditions under which a regular graph G has a k-factor including a given subset of m edges and excluding a disjoint subset of n edges.
The conditions we consider include edge-connectivity and it turns out that, in some sense, those graphs that fail to admit the desired k-factor are "nearly" bipartite.
Date received: April 14, 2008
Copyright © 2008 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 # cawn-38.