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 2 items.

• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)