Pages that link to "Item:Q3832587"
From MaRDI portal
The following pages link to Embedding $m$-quasistars into $n$-cubes (Q3832587):
Displaying 7 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Disjoint cycles and spanning graphs of hypercubes (Q704283) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← links)
- Spanning multi-paths in hypercubes (Q2370445) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- A counter-example to a lemma about embedding starlike trees into hypercube (Q5948743) (← links)