Pages that link to "Item:Q1628689"

The following pages link to A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689):

Displaying 2 items.

• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)