Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Barefoot, C.A., Entringer, R., Swart, H.: Vulnerability in graphs-a comparative study. J. Combin. Math. Combin. Comput. 1, 13–22 (1987)
2. Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D.R., Yatauro, M.: Best monotone degree conditions for graph properties: A survey. Graphs Combin. 31(1), 1–22 (2015)
3. Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Schmeichel, E.: Toughness and vertex degrees. J. Graph Theory 72(2), 209–219 (2013)
4. Bauer, D., Kahl, N., Schmeichel, E., Yatauro, M.: Best monotone degree conditions for binding number. Discrete Math. 311(18–19), 2037–2043 (2011)
5. Bauer, D., Morgana, A., Schmeichel, E.: On the complexity of recognizing tough graphs. Discrete Math. 124(1–3), 13–17 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献