A sufficient condition for the existence of a k-factor excluding a given r-factor

[1]W. Gao, Y. Gao, T. Xu and L. Liang, (2014), Vulnerability of Networks and Existence of Fractional Factor Avoiding Certain Channels and Sites, Journal of Computers 9, No 7, 1712-1722. doi 10.4304/jcp.9.7.1712-1722GaoW.GaoY.XuT.LiangL.2014Vulnerability of Networks and Existence of Fractional Factor Avoiding Certain Channels and SitesJournal of Computers971712172210.4304/jcp.9.7.1712-1722Open DOISearch in Google Scholar

[2]W. Gao and W. Wang, (2015), Toughness and fractional critical deleted graph, Utilitas Mathematica 98, 295-310.GaoW.WangW.2015Toughness and fractional critical deleted graphUtilitas Mathematica98295310Search in Google Scholar

[3]W. Gao, L. Liang, T. Xu and J. Zhou, (2014), Tight Toughness Condition for Fractional (g, f ,n)-Critical Graphs, Journal of the Korean Mathematical Society 51, No 1, 55-65. doi 10.4134/JKMS.2014.51.1.055GaoW.LiangL.XuT.ZhouJ.2014Tight Toughness Condition for Fractional (g, f ,n)-Critical GraphsJournal of the Korean Mathematical Society511556510.4134/JKMS.2014.51.1.055Open DOISearch in Google Scholar

[4]J. Cai, G. Liu and J. Hou, (2008), Binding number and Hamiltonian (g, f )-factors in graphs II, International Journal of Computer Mathematics 85, No 9, 1325-1331. doi 10.1080/00207160701524368CaiJ.LiuG.HouJ.2008Binding number and Hamiltonian (g, f)-factors in graphs IIInternational Journal of Computer Mathematics8591325133110.1080/00207160701524368Open DOISearch in Google Scholar

[5]S. Zhou, (2009), Independence number, connectivity and (a,b,k)-critical graphs, Discrete Mathematics 309, No 12, 4144-4148. doi 10.1016/j.disc.2008.12.013ZhouS.2009Independence number, connectivity and (a,b,k)-critical graphsDiscrete Mathematics309124144414810.1016/j.disc.2008.12.013Open DOISearch in Google Scholar

[6]S. Zhou, (2011), A sufficient condition for graphs to be fractional (k,m)-deleted graphs, Applied Mathematics Letters 24, No 9, 1533-1538. doi 10.1016/j.aml.2011.03.041ZhouS.2011A sufficient condition for graphs to be fractional (k,m)-deleted graphsApplied Mathematics Letters2491533153810.1016/j.aml.2011.03.041Open DOISearch in Google Scholar

[7]S. Zhou, (2010), A sufficient condition for a graph to be an (a,b,k)-critical graph, International Journal of Computer Mathematics 87, No 10, 2202-2211. doi 10.1080/00207160902777914ZhouS.2010A sufficient condition for a graph to be an (a,b,k)-critical graphInternational Journal of Computer Mathematics87102202221110.1080/00207160902777914Open DOISearch in Google Scholar

[8]S. Zhou, (2009), A minimum degree condition of fractional (k,m)-deleted graphs, Comptes Rendus Mathematique 347, No 21-22, 1223-1226. doi 10.1016/j.crma.2009.09.022ZhouS.2009A minimum degree condition of fractional (k,m)-deleted graphsComptes Rendus Mathematique34721-221223122610.1016/j.crma.2009.09.022Open DOISearch in Google Scholar

[9]S. Zhou, (2011), Some new sufficient conditions for graphs to have fractional k-factors, International Journal of Computer Mathematics 88, No 3, 484-490. doi 10.1080/00207161003681286ZhouS.2011Some new sufficient conditions for graphs to have fractional k-factorsInternational Journal of Computer Mathematics88348449010.1080/00207161003681286Open DOISearch in Google Scholar

[10]S. Zhou, (2014), Remarks on orthogonal factorizations of digraphs, International Journal of Computer Mathematics 91, No 10, 2109-2117. doi 10.1080/00207160.2014.881993ZhouS.2014Remarks on orthogonal factorizations of digraphsInternational Journal of Computer Mathematics91102109211710.1080/00207160.2014.881993Open DOISearch in Google Scholar

[11]I. Anderson, (1971), Perfect matchings of a graph, Journal of Combinatorial Theory, Series B 10, No 3, 183-186. doi 10.1016/0095-8956(71)90041-4AndersonI.1971Perfect matchings of a graphJournal of Combinatorial Theory, Series B10318318610.1016/0095-8956(71)90041-4Open DOISearch in Google Scholar

[12]D.R Woodall, (1973), The binding number of a graph and its Anderson number, Journal of Combinatorial Theory Series B 15, No 3, 225-255. doi 10.1016/0095-8956(73)90038-5WoodallD.R1973The binding number of a graph and its Anderson numberJournal of Combinatorial Theory Series B15322525510.1016/0095-8956(73)90038-5Open DOISearch in Google Scholar

[13]P. Katerinis and D.R Woodall, (1987), Binding numbers of graphs and the existence of k-factors, The Quarterly Journal of Mathematics 38, No 2, 221-228. doi 10.1093/qmath/38.2.221KaterinisP.WoodallD.R1987Binding numbers of graphs and the existence of k-factorsThe Quarterly Journal of Mathematics38222122810.1093/qmath/38.2.221Open DOISearch in Google Scholar

[14]H. Matsuda, (2005), Regular Factors Containing a Given Hamiltonian Cycle, in: Combinatorial Geometry and Graph Theory, Vol 3330 of the series Lecture Notes in Computer Science, 123-132. doi 10.1007/978-3-540-30540-8_14MatsudaH.2005Regular Factors Containing a Given Hamiltonian CycleinCombinatorial Geometry and Graph Theory, Vol 3330 of the series Lecture Notes in Computer Science12313210.1007/978-3-540-30540-8_14Open DOISearch in Google Scholar

[15]Y. Gao, G. Li and X. Li, (2009), Degree condition for the existence of a k-factor containing a given Hamiltonian cycle, Discrete Mathematics 309, No 8, 2373-2381. doi 10.1016/j.disc.2008.05.014GaoY.LiG.LiX.2009Degree condition for the existence of a k-factor containing a given Hamiltonian cycleDiscrete Mathematics30982373238110.1016/j.disc.2008.05.014Open DOISearch in Google Scholar

[16]W. T. Tutte, (1952), The factors of graphs, Canadian Journal of Mathematics 4, No 3, 314-328. doi 10.4153/CJM-1952-028-2TutteW. T.1952The factors of graphsCanadian Journal of Mathematics4331432810.4153/CJM-1952-028-2Open DOISearch in Google Scholar