An enhanced method for optimal MMPase staining on paraffin embedded of as sections
- 作者：Jun Zhou ; Ai Fujimoto ; Jagat Narula
- 关键词：Connected even factor ; Cycle ; Claw-free graph
- 刊名：Cell Biology International
- 出版年：2008
- 期刊代码：164_10656995
- 类别：bio
- 出版时间：March 2008
- 卷：32
- 期：3
- 页码：S67
- 文件大小：41 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 s
1 is an integer. In this paper, we show that every supereulerian K1,s-free graph (s2) 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.
1 is an integer. In this paper, we show that every supereulerian K1,s-free graph (s2) 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.