MAT-59-4_EMAS_PAGES_3_6

详细信息    查看全文

• 关键词：Connected even factor ; Cycle ; Claw-free graph
• 刊名：Maturitas
• 出版年：2008
• 出版时间：20 April 2008
• 年：2008
• 卷：59
• 期：4
• 页码：III-V
• 全文大小：189 K

文摘

A connected even [2,2s]-factor of a graph G is a connected factor with all vertices of degree i (i=2,4,…,2s), where s1 is an integer. In this paper, we show that every supereulerian K_1,s-free graph (s2) contains a connected even 409d6580c7"" title=""Click to view the MathML source"" alt=""Click to view the MathML source"">[2,2s-2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected 38984e9f6cfca945"" title=""Click to view the MathML source"" alt=""Click to view the MathML source"">[2,4]-factor by Broersma, Kriesell and Ryjacek.