Pages that link to "Item:Q730490"

The following pages link to A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490):

Displaying 8 items.

• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923) (← links)
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← 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)
• Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
• Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
• How many disjoint 2-edge paths must a cubic graph have? (Q4446888) (← links)
• A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590) (← links)