Embedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer f(n) such that for every set F of f vertices in the hypercube Q(n), with 0  = 3n - 7 for all n >= 5. Our results and an example provided in the paper support the conjecture that f(n) = (n2) - 2 for each n >= 4. New results regarding the existence of longest fault-free paths with prescribed ends are also proved.
hypercube fault tolerant embedding maximal paths with prescribed ends