Pages that link to "Item:Q3985536"
From MaRDI portal
The following pages link to On the Existence of Hamiltonian Circuits in Faulty Hypercubes (Q3985536):
Displaying 43 items.
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
- Fault-tolerant cycle embedding in the faulty hypercubes (Q497933) (← links)
- Hamiltonian cycles in hypercubes with faulty edges (Q497955) (← links)
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes (Q621644) (← links)
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes (Q642966) (← links)
- Fault tolerance in \(k\)-ary \(n\)-cube networks (Q690475) (← links)
- Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← links)
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs (Q777422) (← links)
- Longest fault-free paths in hypercubes with vertex faults (Q819312) (← links)
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes (Q820573) (← links)
- Path bipancyclicity of hypercubes (Q845903) (← links)
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults (Q955008) (← links)
- Conditional fault Hamiltonicity of the complete graph (Q963413) (← links)
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges (Q963441) (← links)
- Conditional fault hamiltonian connectivity of the complete graph (Q987830) (← links)
- Fault-free longest paths in star networks with conditional link faults (Q1006049) (← links)
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model (Q1007887) (← links)
- Long paths in hypercubes with conditional node-faults (Q1010144) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- On the extremal number of edges in Hamiltonian connected graphs (Q1049242) (← links)
- Algorithmic construction of Hamiltonians in pyramids (Q1603354) (← links)
- Hamiltonian laceability in hypercubes with faulty edges (Q1693170) (← links)
- Hamiltonian cycles and paths in faulty twisted hypercubes (Q1730242) (← links)
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges (Q1761611) (← links)
- Linear array and ring embeddings in conditional faulty hypercubes (Q1826641) (← links)
- A note on cycle embedding in hypercubes with faulty vertices (Q1944949) (← links)
- 2-spanning cyclability problems of some generalized Petersen graphs (Q2175232) (← links)
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges (Q2234783) (← links)
- Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model (Q2378525) (← links)
- Edge-bipancyclicity of conditional faulty hypercubes (Q2380034) (← links)
- Regular connected bipancyclic spanning subgraphs of hypercubes (Q2428990) (← links)
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes (Q2465331) (← links)
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
- Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Panconnectivity and edge-pancyclicity of<i>k</i>-ary<i>n</i>-cubes (Q3057098) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- Edge‐fault‐tolerant pancyclicity of alternating group graphs (Q5191151) (← links)
- Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model (Q5859673) (← links)