Paired many-to-many disjoint path covers of hypercubes with faulty edges
From MaRDI portal
(Redirected from Publication:763493)
Recommendations
- Many-to-many disjoint paths in faulty hypercubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Paired many-to-many disjoint path covers of the hypercubes
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- A survey of the theory of hypercube graphs
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Graph theory
- Long paths in hypercubes with a quadratic number of faults
- Long paths in hypercubes with conditional node-faults
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Path embedding in faulty hypercubes
- Path partitions of hypercubes
- Spanning multi-paths in hypercubes
- The two-equal-disjoint path cover problem of matching composition network
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Cited in
(27)- Edge-disjoint paths in faulty hypercube-like networks.
- Spanning paths in hypercubes
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Many-to-many disjoint paths in faulty hypercubes
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
- Paired many-to-many disjoint path covers of the hypercubes
- Edge‐cutsets in the directed hypercube
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Hamiltonian paths in hypercubes with local traps
- Hamiltonian cycles in hypercubes with more faulty edges
- Paired many-to-many disjoint path covers of hypertori
- The super spanning connectivity and super spanning laceability of tori with faulty elements
- Many-to-many disjoint paths in hypercubes with faulty vertices
- One-to-one disjoint path covers on alternating group graphs
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Hamiltonian laceability in hypercubes with faulty edges
- Path coverings with prescribed ends in faulty hypercubes
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
- Paired many-to-many disjoint path covers in faulty hypercubes
- Computing and Combinatorics
- Changing the diameter of the locally twisted cube
This page was built for publication: Paired many-to-many disjoint path covers of hypercubes with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763493)