Degree conditions for fractional (a, b, k)-critical covered graphs

摘要

In this article, we first put forward the concept of a fractional (a, b, k) -critical covered graph, i.e., a graph G is called a fractional (a, b, k) -critical covered graph if after deleting any k vertices of G, the remaining graph of G is a fractional [a, b]-covered graph. Then we derive a degree condition for a graph being a fractional (a, b, k) -critical covered graph, which is an improvement and generalization of Yuan and Hao's previous result (Yuan and Hao (2019) [11]). (C) 2019 Elsevier B.V. All rights reserved.