Pages that link to "Item:Q1628689"
From MaRDI portal
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 6 items.
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)