Pages that link to "Item:Q963388"

The following pages link to The two-equal-disjoint path cover problem of matching composition network (Q963388):

Displaying 26 items.

• Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
• The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
• Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
• Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483) (← links)
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923) (← 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)
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
• Super spanning connectivity on WK-recursive networks (Q1694677) (← links)
• The paths embedding of the arrangement graphs with prescribed vertices in given position (Q1928512) (← links)
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
• Edge-fault-tolerant strong Menger edge connectivity on regular graphs (Q2210512) (← links)
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture (Q2333183) (← 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)
• Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
• Improving the panconnectedness property of locally twisted cubes (Q2931930) (← links)
• General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
• Vertex-pancyclicity of twisted cubes with maximal faulty edges (Q4903570) (← links)
• Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
• An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)