6 search results - page 1 / 2 » Partitions of Faulty Hypercubes into Paths with Prescribed E... |
59
Voted
SIAMDM
2008
15 years 22 days ago
2008
82
Voted
ENDM
2007
15 years 23 days ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
96
Voted
IPL
2008
15 years 24 days ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
95
Voted
DM
2007
15 years 23 days ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
90
Voted
JCO
2010
14 years 11 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...