Pages that link to "Item:Q991753"

The following pages link to Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753):

Displaying 16 items.

• The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
• Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← 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 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)
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle (Q2189829) (← links)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
• Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
• General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
• (Q5036305) (← links)
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)