Neighborhood Conditions for Fractional ID-k-factor-critical Graphs

2018 ◽  
Vol 34 (3) ◽  
pp. 636-644 ◽  
Author(s):  
Si-zhong Zhou ◽  
Zhi-ren Sun
2019 ◽  
Vol 35 (2) ◽  
pp. 458-464 ◽  
Author(s):  
Si-zhong Zhou ◽  
Lan Xu ◽  
Zu-run Xu
Keyword(s):  

2010 ◽  
Vol 53 (5) ◽  
pp. 1385-1391 ◽  
Author(s):  
Tao Wang ◽  
QingLin Yu
Keyword(s):  

1999 ◽  
Vol 15 (2) ◽  
pp. 137-142 ◽  
Author(s):  
Mao-Cheng Cai ◽  
Odile Favaron ◽  
Hao Li
Keyword(s):  

2014 ◽  
Vol 06 (02) ◽  
pp. 1450026
Author(s):  
YUAN YUAN ◽  
ZHIREN SUN

A graph G is fractional independent-set-deletable k-factor-critical if G-I has a fractional k-factor for every independent set I of G. In this paper, we prove that if |V(G)| ≥ k + 2, [Formula: see text] and t(G) ≥ k2 + 6k, then G is fractional ID-k-factor-critical.


2012 ◽  
Vol 84 (1-2) ◽  
pp. 71-76 ◽  
Author(s):  
Sizhong Zhou ◽  
Lan Xu ◽  
Zhiren Sun

1999 ◽  
Vol 15 (4) ◽  
pp. 463-471 ◽  
Author(s):  
Minýong Shi ◽  
Xudong Yuan ◽  
Mao-cheng Cai ◽  
Odile Favaron
Keyword(s):  

2007 ◽  
Vol 307 (1) ◽  
pp. 108-114 ◽  
Author(s):  
N. Ananchuen ◽  
L. Caccetta ◽  
W. Ananchuen
Keyword(s):  

2017 ◽  
Vol 101 (115) ◽  
pp. 205-212
Author(s):  
Yuan Yuan ◽  
Zhiren Sun

A graph G is fractional ID-[a, b]-factor-critical if G?I has a fractional [a, b]-factor for every independent set I of G. We extend a result of Zhou and Sun concerning fractional ID-k-factor-critical graphs.


Sign in / Sign up

Export Citation Format

Share Document