Hamiltonian paths with prescribed edges in hypercubes

Discrete Mathematics

Volumn 307, Issue 16, 2007, Pages 1982-1998

  Dvořák, Tomáš ^a   Gregor, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Fault tolerance; Hamiltonian paths; Hypercube; Prescribed edges

Indexed keywords

FAULT TOLERANCE; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

HAMILTONIAN PATHS; HYPERCUBE; PRESCRIBED EDGES;

HAMILTONIANS;

EID: 34248630788     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.045     Document Type: Article

References (11)

1. Caha R., and Koubek V. Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. J. Graph Theory 51 (2005) 137-169
2. Chan M.Y., and Lee S.-J. On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J. Discrete Math. 4 (1991) 511-527
3. Chen M.-S., and Shin K.G. Processor allocation in an N-cube multiprocessor using Gray codes. IEEE Trans. Comput. C-36 (1987) 1396-1407
4. Dvořák T. Hamiltonian cycles with prescribed edges in hypercubes. SIAM J. Discrete Math. 19 (2005) 135-144
5. Harary F. Graph Theory (1969), Addison-Wesley, New York
6. Harary F., Hayes J.P., and Wu H.-J. A survey of the theory of hypercube graphs. Comput. Math. Appl. 15 (1988) 277-289
7. Havel I. On hamiltonian circuits and spanning trees of hypercubes. Časopis Pěst. Mat. 109 (1984) 135-152
8. Hsu L.-H., Liang T., Tan J., and Tsai C.-H. Fault-tolerant hamiltonian laceability of hypercubes. Inform. Process. Lett. 83 (2002) 301-306
9. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann, San Mateo, CA
10. Savage C. A survey of combinatorial Gray codes. SIAM Rev. 39 (1997) 605-629
11. Sengupta A. On ring embedding in hypercubes with faulty nodes and links. Inform. Process. Lett. 68 (1998) 207-214