Contents

Ars Combinatoria

  • Research article

A Fan-Type Result on Fractional \(ID-k\)-Factor-Critical Graphs

Bin Xu1, Jie Wu2, Qinfen Shi3, Sifeng Liu1
1School of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 211106, P. R. China
2Department of Science and Technology, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212003, P. R. China
3Department of Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210046, P. R. China
  • Published: 31/01/2017

Abstract

Let \(G\) be a graph, and let \(k \geq 2\) be an integer. A graph \(G\) is fractional independent-set-deletable \(k\)-factor-critical (in short, fractional ID-\(k\)-factor-critical) if \(G – I\) has a fractional \(k\)-factor for every independent set \(I\) of \(G\). In this paper, a Fan-type condition for fractional ID-\(k\)-factor-critical graphs is given.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Bin Xu, Jie Wu, Qinfen Shi, Sifeng Liu. A Fan-Type Result on Fractional \(ID-k\)-Factor-Critical Graphs[J], Ars Combinatoria, Volume 131. 55-61. .