Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Partitions of a graph into paths with prescribed endvertices and lengths
Journal of Graph Theory
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
On generalized middle-level problem
Information Sciences: an International Journal
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences: an International Journal
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Single-source three-disjoint path covers in cubes of connected graphs
Information Processing Letters
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
| Hi-index | 0.90 |
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P={{a"i,b"i}}"i"="1^m of pairs of distinct vertices of the n-dimensional hypercube Q"n, is there a path partition {P"i}"i"="1^m of Q"n such that a"i and b"i are endvertices of P"i? Caha and Koubek showed that for 6m==3, there is a balanced set P in Q"n such that 2m-e=n, but no path partition with endvertices prescribed by P exists.