Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. Sufficient degree conditions for k-edge-connectedness of a graph;Bauer;Networks,2009
2. The strongest monotone degree condition for n-connectedness of a graph;Boesch;J. Combin, Theory Ser. B,1974
3. Properties of graphs with constraints on degrees;Bondy;Studia Sci. Math. Hungar.,1969
4. On hamilton’s ideals;Chvátal;J. Combin. Theory Ser. B,1972
5. Some theorems on abstract graphs;Dirac;Proc. Lond. Math. Soc.,1952
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献