A Sufficient Condition for Fractional ( 2 , b , k ) -Critical Covered Graphs
Jie Wu · Journal of Combinatorial Mathematics and Combinatorial Computing · 2024
Zhou, Xu and Sun [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional ( a , b , k ) -critical covered graphs, Information Processing Letters 152(2019)105838] defined the concept of a fractional ( a , b , k ) -critical covered graph, namely, a graph G is a fractional ( a , b , k ) -critical covered graph if after removing any k vertices of G , the remaining graph of G is a fractional [ a , b ] -covered graph. In this paper, we prove that a graph G with δ ( G ) ≥ 2 + k is fractional ( 2 , b , k ) -critical covered if b i n d ( G ) > b + k b − 1 , where k ≥ 0 and b ≥ 2 + k are two integers.