Pages that link to "Item:Q516807"
From MaRDI portal
The following pages link to Completely independent spanning trees in some regular graphs (Q516807):
Displayed 10 items.
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Degree conditions for completely independent spanning trees of bipartite graphs (Q2093107) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- Constructing dual-CISTs of DCell data center networks (Q2286061) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)