Pages that link to "Item:Q3057177"

The following pages link to Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs (Q3057177):

Displaying 2 items.

• Disjoint Hamilton cycles in transposition graphs (Q277617) (← links)
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)