Pages that link to "Item:Q2446439"

The following pages link to Paired many-to-many disjoint path covers of the hypercubes (Q2446439):

Displaying 20 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)
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• Fault-tolerant cycles embedding in hypercubes with faulty edges (Q507746) (← links)
• Generalized Gray codes with prescribed ends (Q512653) (← links)
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges (Q526866) (← links)
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes (Q726167) (← 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)
• One-to-one disjoint path covers in digraphs (Q1694726) (← links)
• Hamiltonian paths in hypercubes with local traps (Q2282293) (← 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)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
• Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree (Q6585257) (← links)