Pages that link to "Item:Q638511"

The following pages link to One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511):

Displaying 27 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
• One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
• Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks (Q781946) (← links)
• An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
• Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes (Q1637214) (← links)
• Super spanning connectivity on WK-recursive networks (Q1694677) (← links)
• One-to-one disjoint path covers in digraphs (Q1694726) (← links)
• The reliability analysis of \(k\)-ary \(n\)-cube networks (Q2192376) (← links)
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices (Q2196925) (← links)
• Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
• Vertex-disjoint paths joining adjacent vertices in faulty hypercubes (Q2330114) (← links)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
• Degree sequence conditions for a graph to be disjoint path coverable (Q2696615) (← links)
• The Super Spanning Connectivity of Arrangement Graphs (Q4639901) (← links)
• (Q5036305) (← links)
• One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)
• THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS (Q5401566) (← links)
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path (Q6048642) (← links)