{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:26:49Z","timestamp":1720657609250},"reference-count":0,"publisher":"Combinatorial Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ars Comb."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>A graph \\(G\\) is called a fractional ID-\\((g,f)\\)-factor-critical covered graph if for any independent set \\(I\\) of \\(G\\) and for every edge \\(e \\in E(G-I)\\), \\(G-I\\) has a fractional \\((g,f)\\)-factor \\(h\\) such that \\(h(e) = 1\\). We give a sufficient condition using degree condition for a graph to be a fractional ID-\\((g,f)\\)-factor-critical covered graph. Our main result is an extension of Zhou, Bian, and Wu\u2019s previous result [S. Zhou, Q. Bian, J. Wu, A result on fractional ID-\\(k\\)-factor-critical graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 87(2013) 229\u2013236] and Yashima\u2019s previous result [T. Yashima, A degree condition for graphs to be fractional ID-\\([a,b]\\)-factor-critical, Australasian Journal of Combinatorics 65(2016) 191\u2013199].<\/jats:p>","DOI":"10.61091\/ars159-01","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T04:53:12Z","timestamp":1720587192000},"page":"03-10","source":"Crossref","is-referenced-by-count":0,"title":["On Fractional ID-\\((g,f)\\)-factor-critical Covered Graphs"],"prefix":"10.61091","volume":"159","author":[{"given":"Sizhong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"School of Science, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212100, P. R. China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"39747","published-online":{"date-parts":[[2024,6,30]]},"container-title":["Ars Combinatoria"],"original-title":[],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T04:53:15Z","timestamp":1720587195000},"score":1,"resource":{"primary":{"URL":"https:\/\/combinatorialpress.com\/ars-articles\/volume-159\/on-fractional-id-gf-factor-critical-covered-graphs\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,6,30]]},"published-print":{"date-parts":[[2024,6,30]]}},"URL":"https:\/\/doi.org\/10.61091\/ars159-01","relation":{},"ISSN":["0381-7032","2817-5204"],"issn-type":[{"value":"0381-7032","type":"print"},{"value":"2817-5204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,30]]}}}