top library bulletin
bar home editorial guideline content
dot
 
Volume 32 • Number 1 • 2009
 
• Neighborhood Conditions and Fractional k-Factors
Sizhong Zhou and Hongxia Liu
Abstract. Let k be an integer such that E16, and let G be a connected graph of order n such that E17, and the minimum degree E18. In this paper, it is proved that
a graph G has a fractional k-factor if E19 for each pair of
non-adjacent vertices E20.

2000 Mathematics Subject Classification: 05C70.


Full text: PDF
 
dot