Pages that link to "Item:Q638511"
From MaRDI portal
The following pages link to One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511):
Displayed 14 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)
- Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← 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)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)
- THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS (Q5401566) (← links)