1. Chvátal, V.: Tough graphs and Hamiltonian circuits. Discrete Math. 5, 215–228 (1973)
2. Woodall, D.R.: The binding number of a graph and its Anderson number. J. Combin. Theory Ser. B 15, 225–255 (1973)
3. Jung, H.A.: On a class of posets and the corresponding comparability graphs. J. Combin. Theory Ser. B 24, 125–133 (1978)
4. Barefoot, C.A., Entringer, R., Swart, H.C.: Vulnerability in graphs - A comparative survey. J. Combin. Math. Combin. Comput. 1, 12–22 (1987)
5. Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of a graph. In: Alavi, Y., Schwenk, A. (eds.) Graph Theory, Combinatorics and Algorithms, Proceedings of 7th International Conference on the Theory and Applications of Graphs, pp. 1111–1122. Wiley, New York (1995)