Hyper-Hamilton laceable and caterpillar-spannable product graphs
From MaRDI portal
Publication:1388980
DOI10.1016/S0898-1221(97)00223-XzbMath0907.05033OpenAlexW2076809366MaRDI QIDQ1388980
Publication date: 1 February 1999
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00223-x
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (46)
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ On the edge-hyper-Hamiltonian laceability of balanced hypercubes ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Mutually independent bipanconnected property of hypercube ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Gray codes with bounded weights ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ On the mutually independent Hamiltonian cycles in faulty hypercubes ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ Embedded paths and cycles in faulty hypercubes ⋮ Hamiltonian cycles and paths in hypercubes with disjoint faulty edges ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ Hamiltonian laceability of hypercubes without isometric subgraphs ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ On the equitable \(k^{*}\)-laceability of hypercubes ⋮ Generalized Gray codes with prescribed ends ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ Some results on topological properties of folded hypercubes ⋮ Hyper Hamiltonian laceability on edge fault star graph ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ On generalized middle-level problem ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Long paths in hypercubes with a quadratic number of faults ⋮ A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ Long paths in hypercubes with conditional node-faults ⋮ Linear array and ring embeddings in conditional faulty hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Cycles in folded hypercubes with two adjacent faulty vertices ⋮ Fault-tolerant Hamiltonian laceability of hypercubes. ⋮ Minimal hyper-Hamilton laceable graphs ⋮ Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant ⋮ The shuffle-cubes and their generalization ⋮ Path coverings with prescribed ends in faulty hypercubes
Cites Work
This page was built for publication: Hyper-Hamilton laceable and caterpillar-spannable product graphs
