|
Organizers |
k-Factors Containing and Avoiding Specified Sets of Edges
by
Keiko Kotani
Department of Mathematics, Tokyo University of Science, Tokyo, Japan
Let r, k, l be integers with 1 ≤ k < r and 2 ≤ l ≤ r. Let G be an r-regular l-edge-connected graph, and let A, B be subsets of E(G) with A ∩B = ∅. In this talk, I will give some results about the existence of a k-factor F with E(F) ⊇ A and E(F) ∩B=∅.
Date received: April 18, 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-47.