Stability Number and k-Hamiltonian [a, b]-factors
暂无分享,去创建一个
[1] Haruhide Matsuda. Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle , 2002, Australas. J Comb..
[2] Jianfeng Hou,et al. The stability number and connected [k, k+1]-factor in graphs , 2009, Appl. Math. Lett..
[3] Sizhong Zhou. A new neighborhood condition for graphs to be fractional (k, m)-deleted graphs , 2012, Appl. Math. Lett..
[4] P. Katerinis,et al. The existence of k-factors in squares of graphs , 2010, Discret. Math..
[5] Shenggui Zhang,et al. Star subdivisions and connected even factors in the square of a graph , 2012, Discret. Math..
[6] László Lovász,et al. Subgraphs with prescribed valencies , 1970 .
[7] Yanjun Li,et al. A [k,k+1]-factor containing given Hamiltonian cycle , 1999, Electron. J. Comb..
[8] Si Zhong Zhou,et al. Binding numbers for fractional ID-k-factor-critical graphs , 2014 .
[9] Sizhong Zhou,et al. Subdigraphs with orthogonal factorizations of digraphs (II) , 2014, Eur. J. Comb..
[10] Guizhen Liu,et al. A Neighborhood Condition for Graphs to Have (g, f)-Factors , 2009, Ars Comb..
[11] Qinglin Yu,et al. Maximum fractional factors in graphs , 2007, Appl. Math. Lett..
[12] Sizhong Zhou. Independence number, connectivity and (a, b, k)-critical graphs , 2009, Discret. Math..