Access the full text.
Sign up today, get DeepDyve free for 14 days.
Wei Gao, Wei Wang, J. Guirao (2019)
The Extension Degree Conditions for Fractional FactorActa Mathematica Sinica, English Series, 36
S. Wang, W. Zhang (2020)
Research on Fractional Critical Covered GraphsProblems of Information Transmission, 56
Sizhong Zhou, Qiuxiang Bian, Q. Pan (2021)
Path factors in subgraphsDiscret. Appl. Math., 319
Sizhong Zhou, Yang Xu, Zhiren Sun (2019)
Degree conditions for fractional (a, b, k)-critical covered graphsInf. Process. Lett., 152
Su Wang, Wei Zhang (2021)
Toughness for Fractional (2, b, k)-Critical Covered GraphsJournal of the Operations Research Society of China, 11
Tadashi Iida, Tsuyoshi Nishimura (1997)
Neighborhood Conditions and $k$-FactorsTokyo Journal of Mathematics, 20
Sizhong Zhou, Zhiren Sun, Q. Pan (2020)
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in GraphsProblems of Information Transmission, 56
Rongxia Hao, Yuan Yuan (2019)
Independence Number, Connectivity and All Fractional (a, b, k)-Critical GraphsDiscussiones Mathematicae Graph Theory, 39
Yuan Yuan, Rongxia Hao (2019)
A degree condition for fractional [a, b]-covered graphsInf. Process. Lett., 143
Hongliang Lu (2013)
Simplified existence theorems on all fractional [a, b][a, b]-factorsDiscret. Appl. Math., 161
Sizhong Zhou, Jiancheng Wu, Qiuxiang Bian (2021)
On path-factor critical deleted (or covered) graphsAequationes mathematicae, 96
Y. Nam (2010)
Binding Numbers and Connected FactorsGraphs and Combinatorics, 26
P. Katerinis (2019)
Fractional ℓ-factors in regular graphsAustralas. J Comb., 73
Sizhong Zhou (2021)
A neighborhood union condition for fractional (a, b, k)-critical covered graphsDiscret. Appl. Math., 323
Sizhong Zhou, Zhiren Sun, Hong-xia Liu (2022)
On P≥3-factor Deleted GraphsActa Mathematicae Applicatae Sinica, English Series, 38
Sizhong Zhou, Qiuxiang Bian, Zhiren Sun (2021)
Two Sufficient Conditions for Component Factors in GraphsDiscussiones Mathematicae Graph Theory, 0
Su Wang, Wei Zhang (2021)
On k-orthogonal factorizations in networksRAIRO Oper. Res., 55
K. Kimura (2013)
Ff-factors, Complete-factors, and Component-deleted SubgraphsDiscret. Math., 313
Hongliang Lu, Qinglin Yu (2011)
General fractional f-factor numbers of graphsAppl. Math. Lett., 24
Wei Gao, Weifan Wang, D. Dimitrov (2019)
Toughness condition for a graph to be all fractional (g,f,n)-critical deletedFilomat
Z Li (2002)
65OR Transactions (China), 6
J. Correa, M. Matamala (2008)
Some remarks about factors of graphsJournal of Graph Theory, 57
Xiangyang Lv (2020)
A degree condition for fractional (g, f, n)-critical covered graphs, 5
P Katerinis (2019)
432Australasian Journal of Combinatorics, 73
Sizhong Zhou, Hongxia Liu, Yang Xu (2021)
A note on fractional ID-[a, b]-factor-critical covered graphsDiscret. Appl. Math., 319
Sizhong Zhou (2019)
Remarks on path factors in graphsRAIRO Oper. Res., 54
G. Liu, Lanju Zhang (2008)
Toughness and the existence of fractional k-factors of graphsDiscret. Math., 308
Sizhong Zhou (2020)
Binding numbers and restricted fractional (g, f)-factors in graphsDiscret. Appl. Math., 305
Sizhong Zhou (2019)
A Result on Fractional (a, b, k)-critical Covered GraphsActa Mathematicae Applicatae Sinica, English Series, 37
Sizhong Zhou, Hong-xia Liu (2022)
Discussions on Orthogonal Factorizations in DigraphsActa Mathematicae Applicatae Sinica, English Series, 38
Sizhong Zhou, Jiancheng Wu, Yang Xu (2021)
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHSBulletin of the Australian Mathematical Society, 106
M. Kano, N. Tokushige (1992)
Binding numbers and f-factors of graphsJ. Comb. Theory, Ser. B, 54
Z. Iangsun (2002)
On Fractional (g, f)-Covered Graphs
Hongliang Lu (2011)
Simplified existence theorems on all fractional [a,b]-factorsarXiv: Combinatorics
D. Woodall (1990)
k-Factors and Neighbourhoods of Independent Sets in GraphsJournal of The London Mathematical Society-second Series, 41
Yuan Yuan, Rongxia Hao (2018)
A Neighborhood Union Condition for Fractional ID-[a, b]-factor-critical GraphsActa Mathematicae Applicatae Sinica, English Series, 34
A graph G is called a fractional [a, b]-covered graph if for each e ∈ E(G), G contains a fractional [a, b]-factor covering e. A graph G is called a fractional (a, b, k)-critical covered graph if for any W ⊆ V(G) with |W| = k, G − W is fractional [a, b]-covered, which was first defined and investigated by Zhou, Xu and Sun [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. In this work, we proceed to study fractional (a, b, k)-critical covered graphs and derive a result on fractional (a, b, k)-critical covered graphs depending on minimum degree and neighborhoods of independent sets.
"Acta Mathematicae Applicatae Sinica, English Series" – Springer Journals
Published: Apr 1, 2022
Keywords: network; fractional (a, b, k)-critical covered graph; minimum degree; neighborhood of independent set; 05C70; 90B18
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.