000			a
999			_c21911 _d21911
003			OSt
005			20241213095712.0
008			241213b xxu||||| |||| 00| 0 eng d
040			_aAIKTC-KRRC _cAIKTC-KRRC
100			_924788 _aXiangyang, Lv
245			_aImprovement of the previous result on fractional (a,b,k)-critical covered graphs
250			_aVol.55(1), Mar
260			_aNew Delhi _bSpringer _c2024
300			_a40-46p.
520			_aA graph G is called fractional [a, b]-covered if for every , G has a fractional [a, b]-factor containing e. A graph G is called fractional (a, b, k)-critical covered if after deleting any k vertices of G, the remaining graph of G is fractional [a, b]-covered. In this paper, we pose a Fan-type condition for a graph being fractional (a, b, k)-critical covered, which is an improvement of Zhou, Xu and Sun’s previous result [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. Furthermore, we claim that the main result in this paper is best possible in some sense.
650		0	_94642 _aHumanities and Applied Sciences
773	0		_dNew Delhi Indian National Science Academy _tIndian journal of pure and applied mathematics _x0019-5588
856			_uhttps://link.springer.com/article/10.1007/s13226-022-00344-4 _yClick here
942			_2ddc _cAR