Pages that link to "Item:Q2444763"

The following pages link to Single-source three-disjoint path covers in cubes of connected graphs (Q2444763):

Displaying 12 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
• Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
• One-to-one disjoint path covers in digraphs (Q1694726) (← links)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
• Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
• One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree (Q6585257) (← links)