Integer k-matchings of graphs: k-Berge–Tutte formula, k-factor-critical graphs and k-barriers

2021 ◽  
Vol 297 ◽  
pp. 120-128
Author(s):  
Yan Liu ◽  
Xueli Su ◽  
Danni Xiong
Keyword(s):  
Critical Graphs ◽  
K Factor

Remarks on Fractional ID-k-factor-critical Graphs

2019 ◽  
Vol 35 (2) ◽  
pp. 458-464 ◽  
Author(s):  
Si-zhong Zhou ◽  
Lan Xu ◽  
Zu-run Xu
Keyword(s):  
Critical Graphs ◽  
K Factor

A conjecture on k-factor-critical and 3-γ-critical graphs

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

(2,k)-Factor-Critical Graphs and Toughness

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

TOUGHNESS AND DEGREE CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS

2014 ◽  
Vol 06 (02) ◽  
pp. 1450026
Author(s):  
YUAN YUAN ◽  
ZHIREN SUN
Keyword(s):  
Independent Set ◽  
Critical Graphs ◽  
Degree Condition ◽  
K Factor

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.

Independence number and minimum degree for fractional ID-k-factor-critical graphs

2012 ◽  
Vol 84 (1-2) ◽  
pp. 71-76 ◽  
Author(s):  
Sizhong Zhou ◽  
Lan Xu ◽  
Zhiren Sun
Keyword(s):  
Minimum Degree ◽  
Independence Number ◽  
Critical Graphs ◽  
K Factor

(3,k)-Factor-Critical Graphs and Toughness

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

scholarly journals A characterization of maximal non-k-factor-critical graphs

2007 ◽  
Vol 307 (1) ◽  
pp. 108-114 ◽  
Author(s):  
N. Ananchuen ◽  
L. Caccetta ◽  
W. Ananchuen
Keyword(s):  
Critical Graphs ◽  
K Factor
Sign in / Sign up

Export Citation Format

Share Document