Pages that link to "Item:Q2341724"

The following pages link to Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724):

Displaying 21 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)
• Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges (Q526866) (← links)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges (Q894448) (← 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)
• The two-equal-disjoint path cover problem of matching composition network (Q963388) (← links)
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
• Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
• Degree sequence conditions for a graph to be disjoint path coverable (Q2696615) (← links)
• Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements (Q4983546) (← links)
• (Q5036305) (← links)
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)
• Paired 2-disjoint path covers of burnt pancake graphs with faulty elements (Q6138830) (← links)
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree (Q6585257) (← links)