Pages that link to "Item:Q4903561"

The following pages link to General-demand disjoint path covers in a graph with faulty elements (Q4903561):

Displaying 8 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)
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← 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)
• The bicube: an interconnection of two hypercubes (Q4983266) (← links)
• One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)