The prism over the middle-levels graph is hamiltonian

Order

Volumn 22, Issue 1, 2005, Pages 73-81

  Horák, Peter ^a   Kaiser, Tomáš ^b   Rosenfeld, Moshe ^a   Ryjáček, Zdeněk ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29344434895     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11083-005-9008-7     Document Type: Article

References (12)

1. Čada, R., Kaiser, T., Rosenfeld, M. and Ryjáček, Z.: Hamiltonian decompositions of prisms over cubic graphs, Discrete Math. 286 (2004), 45-56.
2. Duffus, D. A., Kierstead, H. A. and Snevily, H. S.: An explicit l-factorization in the middle of the Boolean lattice, J. Comb. Theory, Ser. A 65 (1994), 334-342.
3. Duffus, D. A., Sands, B. and Woodrow, R.: Lexicographic matchings cannot form hamiltonian cycles, Order 5 (1988), 149-161.
4. Ellingham, M. N.: Spanning paths, cycles, trees and walks for graphs on surfaces, Congr. Numerantium 115 (1996), 55-90.
5. Havel, I.: Semipaths in directed cubes, in M. Fiedler (ed.), Graphs and Other Combinatorial Topics, Teubner, Leipzig, 1983, pp. 101-108.
6. Jackson, B. and Wormald, N. C.: k-walks of graphs, Australas. J. Combin. 2 (1990), 135-146.
7. Kaiser, T., Král', D., Rosenfeld, M., Ryjáček Z. and Voss, H.-J.: Hamilton cycles in prisms over graphs, submitted.
8. Kierstead, H. A. and Trotter, W. T.: Explicit matchings in the middle levels of the Boolean lattice, Order 5 (1988), 163-171.
9. Paulraja, P.: A characterization of hamiltonian prisms, J. Graph Theory 17 (1993), 161-171.
10. Shields, I. and Savage, C.: A Hamilton path heuristic with applications to the Middle two levels problem, Congr. Numerantium 140 (1999), 161-178.
11. Trotter, T.: private communication, 2004.
12. Zhang, C.-Q.: Integer Flows and Cycle Covers of Graphs, M. Dekker, New York, 1997.