Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. Bauer, D., Hakimi, S.L., Kahl, N., Schmeichel, E. Sufficient degree conditions for k-edge-connectedness of a graph. Networks, 54(2): 95–98 (2009)
2. Boesch, F. The strongest monotone degree condition for n-connectedness of a graph. J. Combin. Theory Ser. B, 16: 162–165 (1974)
3. Bondy, J.A. Properties of graphs with constraints on degrees. Studia Sci. Math. Hungar, 4: 473–475 (1969)
4. Chvátal, V. On Hamilton’s ideals. J. Combin. Theory Ser. B, 12: 163–168 (1972)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献