Long cycles in hypercubes with optimal number of faulty vertices
From MaRDI portal
Publication:1928522
Recommendations
Cites work
- Computational complexity of long paths and cycles in faulty hypercubes
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Fault-tolerant cycle embedding in the hypercube
- Gray codes with bounded weights
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Long paths in hypercubes with conditional node-faults
- Longest fault-free paths in hypercubes with vertex faults
- Survey on path and cycle embedding in some networks
Cited in
(12)- Long paths and cycles in subgraphs of the cube
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
- Construction of maximum cycles in faulty binary hypercubes
- Long cycles in hypercubes with distant faulty vertices
- Hamiltonian laceability of hypercubes with faults of charge one
- Hamiltonian cycles in hypercubes with faulty edges
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Long paths and cycles in faulty hypercubes: existence, optimality, complexity
- Matchings in hypercubes extend to long cycles
- Matchings in hypercubes extend to long cycles
- Long paths and cycles in hypercubes with faulty vertices
- Longest fault-free paths in hypercubes with vertex faults
This page was built for publication: Long cycles in hypercubes with optimal number of faulty vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928522)
