Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamiltonian decompositions of Cayley graphs on Abelian groups
Discrete Mathematics
Cycles through prescribed vertices with large degree sum
Discrete Mathematics
Cycles through subsets with large degree sums
Discrete Mathematics
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Hamiltonian decompositions of Cayley graphs on abelian groups of even order
Journal of Combinatorial Theory Series B
The super laceability of the hypercubes
Information Processing Letters
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
An efficient condition for a graph to be Hamiltonian
Discrete Applied Mathematics
Cyclability of 3-connected graphs
Journal of Graph Theory
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian
Discrete Applied Mathematics
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
Three-round adaptive diagnosis in binary n-cubes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.04 |
A graph G is spanning r-cyclable of order t if for any r nonempty mutually disjoint vertex subsets A"1,A"2,...,A"r of G with |A"1@?A"2@?...@?A"r|@?t, there exist r disjoint cycles C"1,C"2,...,C"r of G such that C"1@?C"2@?...@?C"r spans G, and C"i contains A"i for every i. In this paper, we prove that the n-dimensional hypercube Q"n is spanning 2-cyclable of order n-1 for n=3. Moreover, Q"n is spanning k-cyclable of order k if k@?n-1 for n=2. The spanning r-cyclability of a graph G is the maximum integer t such that G is spanning r-cyclable of order k for k=r,r+1,...,t but is not spanning r-cyclable of order t+1. We also show that the spanning 2-cyclability of Q"n is n-1 for n=3.