Connected even factors in claw-free graphs

Li, M.C. and Xiong, L. and Broersma, H.J. (2008) Connected even factors in claw-free graphs. Discrete Mathematics, 308 (11). pp. 2282-2284. ISSN 0012-365X

PDF
Restricted to UT campus only: Request a copy
127Kb

Abstract:	A connected even $[2,2s]$ -factor of a graph $G$ is a connected factor with all vertices of degree $i(i=2,4,\ldots,2s)$ , where $s\ge 1$ is an integer. In this paper, we show that every supereulerian $K_{1,s}$ -free graph $(s\ge 2)$ contains a connected even $[2,2s-2]$ -factor, hereby generalizing the result that every 4-connected claw-free graph has a connected $[2,4]$ -factor by Broersma, Kriesell and Ryjacek.
Item Type:	Article
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/62552
Official URL:	http://dx.doi.org/10.1016/j.disc.2007.04.058
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 254916