Hamiltonian cycles with prescribed edges in hypercubes

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 1, 2005, Pages 135-144

  Dvořák, Tomáš ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Hamiltonian cycles passing through given edges; Hypercube

Indexed keywords

COMPUTATIONAL COMPLEXITY; HAMILTONIANS;

HAMILTONIAN CYCLE; HYPERCUBE;

GRAPH THEORY;

EID: 33644603977     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103432805     Document Type: Article

References (12)

1. R. CAHA AND V. KOUBEK, Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets, J. Graph Theory, submitted.
2. M. Y. CHAN AND S.-J. LEE, On the existence of Hamiltonian circuits in faulty hypercubes, SIAM J. Discrete Math., 4 (1991), pp. 511-527.
3. M.-S. CHEN AND K. G. SHIN, Processor allocation in an N-cube multiprocessor using Gray codes, IEEE Trans. Comput., C-36 (1987), pp. 1396-1407.
4. T. DVOŘÁK AND P. GREGOR, Hamiltonian paths with prescribed edges in hypercubes, in Proceedings of Eurocomb '03 (European Conference on Combinatorics, Graph Theory and Applications, Prague, September 8-12, 2003), submitted.
5. L. GROS, Théorie du Baguenodier, Aimé Vingtrinier, Lyon, 1872.
6. F. HARARY, Graph Theory, Addison-Wesley, New York, 1969.
7. F. HARARY, J. P. HAYES, AND H.-J. Wu, A survey of the theory of hypercube graphs, Comput. Math. Appl., 15 (1988), pp. 277-289.
8. I. HAVEL, On Hamiltonian circuits and spanning trees of hypercubes, Čas. Pěst. Mat., 109 (1984), pp. 135-152.
9. G. KREWERAS, Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Combin. Appl., 16 (1996), pp. 87-91.
10. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
11. C. SAVAGE, A survey of combinatorial Gray codes, SIAM Rev., 39 (1997), pp. 605-629.
12. A. SENGUPTA, On ring embedding in hypercubes with faulty nodes and links, Inform. Process. Lett., 68 (1998), pp. 207-214.