Recommendations
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- On path bipancyclicity of hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- On the bipanpositionable bipanconnectedness of hypercubes
- The bipanpositionable bipancyclic property of the hypercube
Cites work
- scientific article; zbMATH DE number 3902696 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Linear array and ring embeddings in conditional faulty hypercubes
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
Cited in
(32)- The bipanpositionable bipancyclic property of the hypercube
- Cycles embedding in exchanged crossed cube
- Efficient unicast in bijective connection networks with the restricted faulty node set
- The 2-path-bipanconnectivity of hypercubes
- Survey on path and cycle embedding in some networks
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- On paths and cycles dominating hypercubes
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
- Two node-disjoint paths in balanced hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
- On path bipancyclicity of hypercubes
- The bipancycle-connectivity of the hypercube
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Finding cycles in hierarchical hypercube networks
- Paths in \([ h , k ]\)-bipartite hypertournaments
- On the bipanpositionable bipanconnectedness of hypercubes
- A note on path bipancyclicity of hypercubes
- Mutually independent bipanconnected property of hypercube
- Cycles and paths embedded in varietal hypercubes
- The bicube: an interconnection of two hypercubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Cycles passing through a prescribed path in a hypercube with faulty edges
- On 3-regular bipancyclic subgraphs of hypercubes
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Vertex-bipancyclicity of the generalized honeycomb tori
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- The path-distance-width of hypercubes
- The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd
- Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
This page was built for publication: Path bipancyclicity of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845903)
