z-logo
open-access-imgOpen Access
Neighbourhood conditions for fractional ID-[a, b]-factor-critical graphs
Author(s) -
Yuan Yuan,
ZhiWei Sun
Publication year - 2017
Publication title -
publications de l'institut mathématique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1715205y
Subject(s) - factor (programming language) , mathematics , graph , neighbourhood (mathematics) , combinatorics , discrete mathematics , computer science , mathematical analysis , programming language
A graph G is fractional ID-[a, b]-factor-critical if G?I has a fractional [a, b]-factor for every independent set I of G. We extend a result of Zhou and Sun concerning fractional ID-k-factor-critical graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here