|
Organizers |
Claw-Free Graphs and 2-Factors
that Separate Independent Vertices
by
Colton Magnant
Lehigh University
Coauthors: Ralph J. Faudree, Univ. of Memphis, Kenta Ozeki, Keio University, and Kiyoshi Yoshimto, Nihon University
An independent set S of vertices in a graph G is said to be separated by a 2-factor F of G if each vertex of S is in a different cycle of F. If the number of cycles in F is equal to the number of vertices in S, then the set S is said to be precisely separated by F. We will discuss minimum degree conditions implying that claw-free or line graphs have a 2-factor that separates or precisely separates independent sets of vertices.
Date received: March 22, 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-04.