Author:
Bauer Douglas,Broersma Hajo,Schmeichel Edward
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference162 articles.
1. Ainouche, A., Christofides, N.: Conditions for the existence of harniltonian circuits in graphs based on vertex degrees. J London Math Soc 32, 385–391 (1985)
2. Alon, N.: Tough ramsey graphs without short cycles. Journal of Algebraic Combinatorics 4, 189–195 (1995)
3. Balakrishnan, R., Paulraja, P.: Chordal graphs and some of their derived graphs. Congr Numer 53, 71–74 (1986)
4. Barefoot, C.A., Entringer, R., Swart, H.: Vulnerability in graphs - a comparative survey. J. Combin. Math. Combin. Comput 1, 13–22 (1987)
5. Bauer, D., Broersma, H.J., van den Heuvel, J., Veldman, H.J.: On hamiltonian properties of 2-tough graphs. J. Graph Theory 18, 539–543 (1994)
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献