Pages that link to "Item:Q1929236"

The following pages link to Matching preclusion for balanced hypercubes (Q1929236):

Displaying 41 items.

• Hamiltonian cycle embedding for fault tolerance in balanced hypercubes (Q278371) (← links)
• Strong matching preclusion for \(n\)-dimensional torus networks (Q287442) (← links)
• Matching preclusion for vertex-transitive networks (Q290107) (← links)
• On the edge-hyper-Hamiltonian laceability of balanced hypercubes (Q339462) (← links)
• Strong matching preclusion for augmented cubes (Q387805) (← links)
• Vertex-fault-tolerant cycles embedding in balanced hypercubes (Q508760) (← links)
• Various cycles embedding in faulty balanced hypercubes (Q527210) (← links)
• Fault-tolerant Hamiltonian laceability of balanced hypercubes (Q528717) (← links)
• Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks (Q1637216) (← links)
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes (Q1685964) (← links)
• Strong matching preclusion for \(k\)-composition networks (Q1698726) (← links)
• Cycles embedding in balanced hypercubes with faulty edges and vertices (Q1701112) (← links)
• Edge-disjoint Hamiltonian cycles of balanced hypercubes (Q1721931) (← links)
• Matching preclusion number in product graphs (Q1725689) (← links)
• Hamiltonian paths passing through prescribed edges in balanced hypercubes (Q1727385) (← links)
• Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes (Q1730017) (← links)
• Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes (Q1736130) (← links)
• Matching preclusion for \(n\)-grid graphs (Q1752462) (← links)
• Structure and substructure connectivity of balanced hypercubes (Q1988575) (← links)
• Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) (Q2012058) (← links)
• Conditional matching preclusion for regular bipartite graphs and their Cartesian product (Q2028067) (← links)
• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links (Q2098177) (← links)
• The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs (Q2165283) (← links)
• Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes (Q2185407) (← links)
• The reliability analysis based on the generalized connectivity in balanced hypercubes (Q2223684) (← links)
• A note on generalized matching preclusion in bipartite graphs (Q2272412) (← links)
• Matching preclusion for direct product of regular graphs (Q2306600) (← links)
• Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
• Path embeddings with prescribed edge in the balanced hypercube network (Q2333505) (← links)
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube (Q2344732) (← links)
• Matching preclusion for cube-connected cycles (Q2352789) (← links)
• Matching preclusion for \(n\)-dimensional torus networks (Q2357377) (← links)
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes (Q2416418) (← links)
• On extra connectivity and extra edge-connectivity of balanced hypercubes (Q2423001) (← links)
• Conditional fractional matching preclusion of \(n\)-dimensional torus networks (Q2659173) (← links)
• Hamiltonian cycles of balanced hypercube with more faulty edges (Q2682937) (← links)
• The genus of the balanced hypercube (Q2798321) (← links)
• On anti-Kekulé and \(s\)-restricted matching preclusion problems (Q6039537) (← links)
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest (Q6114850) (← links)
• An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes (Q6135724) (← links)