Pages that link to "Item:Q764341"

The following pages link to Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341):

Displaying 2 items.

• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups (Q2512654) (← links)