{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:28:35Z","timestamp":1775017715819,"version":"3.50.1"},"reference-count":29,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1134\/s0032946020040043","type":"journal-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T09:02:58Z","timestamp":1611738178000},"page":"332-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Sufficient Condition for the Existence of Restricted Fractional (g,\u00a0f)-Factors in Graphs"],"prefix":"10.1134","volume":"56","author":[{"given":"S.","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q.","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"key":"5008_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A. and Murty, U.S.R., Graph Theory, Berlin: Springer, 2008."},{"issue":"no. 1","key":"5008_CR2","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"RP Anstee","year":"1985","unstructured":"Anstee, R.P., An Algorithmic Proof of Tutte\u2019s f-Factor Theorem, J. Algorithms, 1985, vol.\u00a06, no.\u00a01, pp.\u00a0112\u2013131.","journal-title":"J. Algorithms"},{"issue":"no. 4","key":"5008_CR3","first-page":"541","volume":"21","author":"G Liu","year":"2001","unstructured":"Liu, G. and Zhang, L., Fractional (g,\u00a0f)-Factors of Graphs, Acta Math. Sci. Ser. B (Engl. Ed.), 2001, vol.\u00a021, no.\u00a04, pp.\u00a0541\u2013545.","journal-title":"Acta Math. Sci. Ser. B (Engl. Ed.)"},{"issue":"no. 4","key":"5008_CR4","first-page":"65","volume":"6","author":"Z Li","year":"2002","unstructured":"Li, Z., Yan, G., and Zhang, X., On Fractional (g,\u00a0f)-Covered Graphs, OR Trans. (in Chinese), 2002, vol.\u00a06, no.\u00a04, pp.\u00a065\u201368.","journal-title":"OR Trans. (in Chinese)"},{"issue":"no. 2","key":"5008_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.3836\/tjm\/1270042114","volume":"20","author":"T Iida","year":"1997","unstructured":"Iida, T. and Nishimura, T., Neighborhood Conditions and k-Factors, Tokyo J. Math., 1997, vol.\u00a020, no.\u00a02, pp.\u00a0411\u2013418.","journal-title":"Tokyo J. Math."},{"issue":"no. 1","key":"5008_CR6","first-page":"37","volume":"32","author":"S Zhou","year":"2009","unstructured":"Zhou, S. and Liu, H., Neighborhood Conditions and Fractional k-Factors, Bull. Malays. Math. Sci. Soc. (2), 2009, vol.\u00a032, no.\u00a01, pp.\u00a037\u201345.","journal-title":"Bull. Malays. Math. Sci. Soc. (2)"},{"issue":"no. 1","key":"5008_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.disc.2017.08.035","volume":"341","author":"H Liu","year":"2018","unstructured":"Liu, H. and Lu, H., A Degree Condition for a Graph to Have (a,\u00a0b)-Parity Factors, Discrete Math., 2018, vol.\u00a0341, no.\u00a01, pp.\u00a0244\u2013252.","journal-title":"Discrete Math."},{"issue":"no. 7-8","key":"5008_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"MD Plummer","year":"2007","unstructured":"Plummer, M.D., Graph Factors and Factorization: 1985\u20132003: A Survey, Discrete Math., 2007, vol.\u00a0307, no.\u00a07\u20138, pp.\u00a0791\u2013821.","journal-title":"Discrete Math."},{"issue":"no. 10","key":"5008_CR9","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1080\/00207160.2014.881993","volume":"91","author":"S Zhou","year":"2014","unstructured":"Zhou, S., Remarks on Orthogonal Factorizations of Digraphs, Int. J. Comput. Math., 2014, vol.\u00a091, no.\u00a010, pp.\u00a02109\u20132117.","journal-title":"Int. J. Comput. Math."},{"issue":"no. 3","key":"5008_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1051\/ro\/2017045","volume":"53","author":"S Zhou","year":"2019","unstructured":"Zhou, S., Some Results about Component Factors in Graphs, RAIRO Oper. Res., 2019, vol.\u00a053, no.\u00a03, pp.\u00a0723\u2013730.","journal-title":"RAIRO Oper. Res."},{"key":"5008_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, S. and Sun, Z., Binding Number Conditions for P\u22652-Factor and P\u22653-Factor Uniform Graphs, Discrete Math., 2020, vol.\u00a0343, no.\u00a03, Article 111715 (6\u00a0pp.).","DOI":"10.1016\/j.disc.2019.111715"},{"issue":"no. 8","key":"5008_CR12","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10114-020-9224-5","volume":"36","author":"SZ Zhou","year":"2020","unstructured":"Zhou, S.Z. and Sun, Z.R., Some Existence Theorems on Path Factors with Given Properties in Graphs, Acta Math. Sin. (Engl. Ser.), 2020, vol.\u00a036, no.\u00a08, pp.\u00a0917\u2013928.","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"issue":"no. 1","key":"5008_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.55016\/ojs\/cdm.v14i1.62676","volume":"14","author":"S Zhou","year":"2019","unstructured":"Zhou, S., Sun, Z., and Liu, H. ,Sun Toughness and P\u22653-Factors in Graphs, Contrib. Discrete Math., 2019, vol.\u00a014, no.\u00a01, pp.\u00a0167\u2013174.","journal-title":"Contrib. Discrete Math."},{"key":"5008_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ipl.2017.12.003","volume":"132","author":"Z Sun","year":"2018","unstructured":"Sun, Z. and Zhou, S., A Generalization of Orthogonal Factorizations in Digraphs, Inform. Process. Lett., 2018, vol.\u00a0132, pp.\u00a049\u201354.","journal-title":"Inform. Process. Lett."},{"key":"5008_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.dam.2019.12.011","volume":"286","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Zhang, T., and Xu, Z., Subgraphs with Orthogonal Factorizations in Graphs, Discrete Appl. Math., 2020, vol.\u00a0286, pp.\u00a029\u201334.","journal-title":"Discrete Appl. Math."},{"issue":"no. 6","key":"5008_CR16","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1051\/ro\/2019111","volume":"54","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Remarks on Path Factors in Graphs, RAIRO. Oper. Res., 2020, vol.\u00a054, no.\u00a06, pp.\u00a01827\u20131834.","journal-title":"RAIRO. Oper. Res."},{"issue":"no. 6","key":"5008_CR17","first-page":"3510","volume":"26","author":"S Zhou","year":"2019","unstructured":"Zhou, S., Yang, F., and Xu, L., Two Sufficient Conditions for the Existence of Path Factors in Graphs, Sci. Iran. D: Comput. Sci. Eng. Electr. Eng., 2019, vol.\u00a026, no.\u00a06, pp.\u00a03510\u20133514.","journal-title":"Sci. Iran. D: Comput. Sci. Eng. Electr. Eng."},{"issue":"no. 3","key":"5008_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10255-014-0411-y","volume":"30","author":"J Cai","year":"2014","unstructured":"Cai, J., Wang, X., and Yan, G., A Note on the Existence of Fractional f-Factors in Random Graphs, Acta Math. Appl. Sin. Engl. Ser., 2014, vol.\u00a030, no.\u00a03, pp.\u00a0677\u2013680.","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"no. 1","key":"5008_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12346-016-0222-z","volume":"17","author":"W Gao","year":"2018","unstructured":"Gao, W., Guirao, J.L.G., and Wu, H., Two Tight Independent Set Conditions for Fractional (g,\u00a0f,\u00a0m)-Deleted Graphs Systems, Qual. Theory. Dyn. Syst., 2018, vol.\u00a017, no.\u00a01, pp.\u00a0231\u2013243.","journal-title":"Qual. Theory. Dyn. Syst."},{"issue":"no. 7","key":"5008_CR20","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s10114-019-8169-z","volume":"35","author":"W Gao","year":"2019","unstructured":"Gao, W., Guirao, J.L.G., and Chen, Y.J., A Toughness Condition for Fractional (k,\u00a0m)-Deleted Graphs Revisited, Acta Math. Sin. (Engl. Ser.), 2019, vol.\u00a035, no.\u00a07, pp.\u00a01227\u20131237.","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"issue":"no. 9","key":"5008_CR21","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.2298\/FIL1909735G","volume":"33","author":"W Gao","year":"2019","unstructured":"Gao, W., Wang, W., and Dimitrov, D., Toughness Condition for a Graph to Be All Fractional (g,\u00a0f,\u00a0n)-Critical Deleted, Filomat., 2019, vol.\u00a033, no.\u00a09, pp.\u00a02735\u20132746.","journal-title":"Filomat."},{"issue":"no. 2","key":"5008_CR22","doi-asserted-by":"publisher","first-page":"872","DOI":"10.3934\/math.2020059","volume":"5","author":"X Lv","year":"2020","unstructured":"Lv, X., A Degree Condition for Fractional (g,\u00a0f,\u00a0n)-Critical Covered Graphs, AIMS Math., 2020, vol.\u00a05, no.\u00a02, pp.\u00a0872\u2013878.","journal-title":"AIMS Math."},{"issue":"no. 4","key":"5008_CR23","doi-asserted-by":"publisher","first-page":"4495","DOI":"10.3233\/JIFS-169768","volume":"35","author":"J Wu","year":"2018","unstructured":"Wu, J., Yuan, J., and Siddiqui, M.K., Independent Set Conditions for All Fractional $$(g,f,n^{\\prime} ,m)$$-Critical Deleted NFV Networks, J. Intell. Fuzzy Syst., 2018, vol.\u00a035, no.\u00a04, pp.\u00a04495\u20134502.","journal-title":"J. Intell. Fuzzy Syst."},{"key":"5008_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ipl.2018.11.002","volume":"143","author":"Y Yuan","year":"2019","unstructured":"Yuan, Y. and Hao, R.-X., A Degree Condition for Fractional [a,\u00a0b]-Covered Graphs, Inform. Process. Lett., 2019, vol.\u00a0143, pp.\u00a020\u201323.","journal-title":"Inform. Process. Lett."},{"issue":"no. 8","key":"5008_CR25","doi-asserted-by":"publisher","first-page":"2308","DOI":"10.1016\/j.disc.2019.05.004","volume":"342","author":"Y Yuan","year":"2019","unstructured":"Yuan, Y. and Hao, R.-X., Toughness Condition for the Existence of All Fractional (a,\u00a0b,\u00a0k)-Critical Graphs, Discrete Math., 2019, vol.\u00a0342, no.\u00a08, pp.\u00a02308\u20132314.","journal-title":"Discrete Math."},{"issue":"no. 8","key":"5008_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2013.01.021","volume":"113","author":"S Zhou","year":"2013","unstructured":"Zhou, S., Sun, Z., and Ye, H., A Toughness Condition for Fractional (k,\u00a0m)-Deleted Graphs, Inform. Process. Lett., 2013, vol.\u00a0113, no.\u00a08, pp.\u00a0255\u2013259.","journal-title":"Inform. Process. Lett."},{"issue":"no. 2","key":"5008_CR27","first-page":"115","volume":"21","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Liu, H., and Xu, Y., Binding Numbers for Fractional (a,\u00a0b,\u00a0k)-Critical Covered Graphs, Proc. Rom. Acad. Ser.\u00a0A Math. Phys. Tech. Sci. Inf. Sci., 2020, vol.\u00a021, no.\u00a02, pp.\u00a0115\u2013121.","journal-title":"Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci."},{"issue":"no. 2","key":"5008_CR28","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/s10255-019-0818-6","volume":"35","author":"S Zhou","year":"2019","unstructured":"Zhou, S., Xu, L., and Xu, Z., Remarks on Fractional ID-k-Factor-Critical Graphs, Acta Math. Appl. Sin. Engl. Ser., 2019, vol.\u00a035, no.\u00a02, pp.\u00a0458\u2013464.","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"key":"5008_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, S., Xu, Y., and Sun, Z., Degree Conditions for Fractional (a,\u00a0b,\u00a0k)-Critical Covered Graphs, Inform. Process. Lett., 2019, vol.\u00a0152, Article 105838 (5\u00a0pp.).","DOI":"10.1016\/j.ipl.2019.105838"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020040043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020040043","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020040043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:47:50Z","timestamp":1775011670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020040043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5008"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020040043","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"21 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}