On hamiltonian cycles in the prism over the odd graphs
- 12 November 2010
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 177-188
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Hamiltonian paths in odd graphsApplicable Analysis and Discrete Mathematics, 2009
- Hamilton cycles in prismsJournal of Graph Theory, 2007
- The Prism Over the Middle-levels Graph is HamiltonianOrder, 2005
- Hamiltonian decompositions of prisms over cubic graphsDiscrete Mathematics, 2004
- Explicit 2-Factorisations of the Odd GraphOrder, 2004
- Long cycles in the middle two layers of the discrete cubeJournal of Combinatorial Theory, Series A, 2004
- Triangle-free Hamiltonian Kneser graphsJournal of Combinatorial Theory, Series B, 2003
- An explicit 1-factorization in the middle of the boolean latticeJournal of Combinatorial Theory, Series A, 1994
- A characterization of Hamiltonian prismsJournal of Graph Theory, 1993
- Explicit matchings in the middle levels of the Boolean latticeOrder, 1988