Path bipancyclicity of hypercubes
Information Processing Letters
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Note: Perfect matchings extend to Hamilton cycles in hypercubes
Journal of Combinatorial Theory Series B
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Information Processing Letters
Some results on topological properties of folded hypercubes
Information Processing Letters
On path bipancyclicity of hypercubes
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Matching graphs of hypercubes and complete bipartite graphs
European Journal of Combinatorics
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Computational complexity of long paths and cycles in faulty hypercubes
Theoretical Computer Science
Embedded paths and cycles in faulty hypercubes
Journal of Combinatorial Optimization
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
Hamiltonian cycles through prescribed edges in k-ary n-cubes
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
| Hi-index | 0.00 |
Given a set ${\cal P}$ of at most 2n-3 prescribed edges ($n\ge2$), the n-dimensional hypercube Qn contains a Hamiltonian cycle passing through all edges of ${\cal P}$ iff the subgraph induced by ${\cal P}$ consists of pairwise vertex-disjoint paths. This answers a question of Caha and Koubek, who showed that for any $n\ge3$ there are 2n-2 edges of Qn not contained in any Hamiltonian cycle, but that still satisfy the above condition.