Pages that link to "Item:Q1042541"

The following pages link to Survey on path and cycle embedding in some networks (Q1042541):

Displaying 46 items.

• Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges (Q265083) (← links)
• Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
• Hamilton paths and cycles in varietal hypercube networks with mixed faults (Q274757) (← links)
• Conditional edge-fault pancyclicity of augmented cubes (Q392181) (← links)
• Geodesic pancyclicity of twisted cubes (Q424780) (← links)
• The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
• Edge-fault-tolerant pancyclicity of arrangement graphs (Q508679) (← links)
• Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
• Fault-tolerant edge-pancyclicity of locally twisted cubes (Q545346) (← links)
• Edge-bipancyclicity of star graphs with faulty elements (Q650935) (← links)
• Panconnectivity and edge-pancyclicity of multidimensional torus networks (Q741532) (← links)
• Cycles passing through a prescribed path in a hypercube with faulty edges (Q765497) (← links)
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes (Q967363) (← links)
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
• Fault-tolerant panconnectivity of augmented cubes (Q1034902) (← links)
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes (Q1685964) (← links)
• Hamiltonian cycles and paths in faulty twisted hypercubes (Q1730242) (← links)
• Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks (Q1735685) (← links)
• Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes (Q1736130) (← links)
• Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model (Q1750533) (← links)
• Long cycles in hypercubes with optimal number of faulty vertices (Q1928522) (← links)
• A note on cycle embedding in hypercubes with faulty vertices (Q1944949) (← links)
• \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (Q2089930) (← links)
• \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) (Q2144839) (← links)
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q2175471) (← links)
• Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes (Q2185407) (← links)
• The vertex-pancyclicity of data center networks (Q2220882) (← links)
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
• Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← links)
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013) (← links)
• Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle (Q2673946) (← links)
• Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969) (← links)
• The spanning cyclability of Cayley graphs generated by transposition trees (Q2685695) (← links)
• Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults (Q5205025) (← links)
• Fault-Tolerant Panconnectivity of Augmented Cubes AQn (Q5207034) (← links)
• Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
• Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes (Q6038696) (← links)
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path (Q6048642) (← links)
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs (Q6102214) (← links)
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn (Q6169868) (← links)
• Embedding Wheel - like Networks (Q6187747) (← links)
• The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)
• Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)