Abstract
Let B k be the bipartite graph defined by the subsets of {1,…,2k + 1} of size k and k + 1. We prove that the prism over B k is hamiltonian. We also show that B k has a closed spanning 2-trail.
Similar content being viewed by others
References
Čada, R., Kaiser, T., Rosenfeld, M. and Ryjáček, Z.: Hamiltonian decompositions of prisms over cubic graphs, Discrete Math. 286 (2004), 45–56.
Duffus, D. A., Kierstead, H. A. and Snevily, H. S.: An explicit 1-factorization in the middle of the Boolean lattice, J. Comb. Theory, Ser. A 65 (1994), 334–342.
Duffus, D. A., Sands, B. and Woodrow, R.: Lexicographic matchings cannot form hamiltonian cycles, Order 5 (1988), 149–161.
Ellingham, M. N.: Spanning paths, cycles, trees and walks for graphs on surfaces, Congr. Numerantium 115 (1996), 55–90.
Havel, I.: Semipaths in directed cubes, in M. Fiedler (ed.), Graphs and Other Combinatorial Topics, Teubner, Leipzig, 1983, pp. 101–108.
Jackson, B. and Wormald, N. C.: k-walks of graphs, Australas. J. Combin. 2 (1990), 135–146.
Kaiser, T., Král', D., Rosenfeld, M., Ryjáček Z. and Voss, H.-J.: Hamilton cycles in prisms over graphs, submitted.
Kierstead, H. A. and Trotter, W. T.: Explicit matchings in the middle levels of the Boolean lattice, Order 5 (1988), 163–171.
Paulraja, P.: A characterization of hamiltonian prisms, J. Graph Theory 17 (1993), 161–171.
Shields, I. and Savage, C.: A Hamilton path heuristic with applications to the Middle two levels problem, Congr. Numerantium 140 (1999), 161–178.
Trotter, T.: private communication, 2004.
Zhang, C.-Q.: Integer Flows and Cycle Covers of Graphs, M. Dekker, New York, 1997.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by project 1M0021620808 and Research Plan MSM 4977751301 of the Czech Ministry of Education.
Rights and permissions
About this article
Cite this article
Horák, P., Kaiser, T., Rosenfeld, M. et al. The Prism Over the Middle-levels Graph is Hamiltonian. Order 22, 73–81 (2005). https://doi.org/10.1007/s11083-005-9008-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-005-9008-7