论文信息 - Hamiltonian cycles in I-graphs

Hamiltonian cycles in I-graphs

Abstract The I–graphs generalize the family of generalized Petersen graphs. We show that a connected I–graph which is not a generalized Petersen graph is Hamiltonian.

Tomaz Pisanski | Simona Bonvicini

[1] M. Watkins,et al. A theorem on tait colorings with an application to the generalized Petersen graphs , 1969 .

[2] Tomaž Pisanski,et al. I‐graphs and the corresponding configurations , 2005 .

[3] Alfred Bray Kempe. I. A memoir on the theory of mathematical form , 1886, Philosophical Transactions of the Royal Society of London.

[4] Brian Alspach. The classification of hamiltonian generalized Petersen graphs , 1983, J. Comb. Theory, Ser. B.

[5] H. Coxeter. Self-dual configurations and regular graphs , 1950 .