Pages that link to "Item:Q4974983"

The following pages link to Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements (Q4974983):

Displaying 43 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)
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
• Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← 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)
• Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← 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)
• Strong matching preclusion (Q653338) (← links)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← 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)
• Complete binary trees embeddings in Möbius cubes (Q896018) (← 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)
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
• One-to-one disjoint path covers in digraphs (Q1694726) (← links)
• Strong matching preclusion under the conditional fault model (Q1949116) (← links)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
• Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
• Fractional matching preclusion of the restricted HL-graphs (Q2279755) (← links)
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← 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)
• Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
• Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← links)
• Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
• Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses (Q2700790) (← links)
• Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
• General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
• Hamiltonian properties on a class of circulant interconnection networks (Q5012825) (← links)
• Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest (Q6114850) (← links)
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)