Toughness of generalized Petersen graphs

Ars Combinatoria

Volumn 66, Issue , 2003, Pages 49-63

  Ferland, Kevin ^a  

^a BLOOMSBURG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26844448621     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. B. Alspach, The classification of Hamiltonian generalized Petersen graphs, Journal of Combinatorial Theory, Series B 34 (1983), 293-312.
2. K. J. Bagga and M. J. Lipman, A characterization of vertex transitive graphs of toughness one, Bulletin of the ICA 10 (1994), 39-49.
3. V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973), 215-228.
4. K. K. Ferland, On the toughness of some generalized Petersen graphs, Ars Combinatoria 36 (1993), 65-88.
5. R. Frucht, J. E. Graver, and M. E. Watkins, The groups of the generalized Petersen graphs, Proc. Camb. Phil. Soc. 70 (1971), 211-218.
6. B. Piazza, R. Ringeisen, and S. Stueckle, On the vulnerability of cycle permutation graphs, Ars Combinatoria 29 (1990), 289-296.
7. M. E. Watkins, A theorem on Tait colorings with an application to the generalized Petersen graphs, Journal of Combinatorial Theory 6 (1969), 152-164.