Pages that link to "Item:Q516807"
From MaRDI portal
The following pages link to Completely independent spanning trees in some regular graphs (Q516807):
Displaying 24 items.
- Independent spanning trees of chordal rings (Q294645) (← links)
- Ore's condition for completely independent spanning trees (Q406328) (← links)
- Two counterexamples on completely independent spanning trees (Q409435) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- On independent spanning trees (Q1198088) (← links)
- Spanning trees with pairwise nonadjacent endvertices (Q1363666) (← links)
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- Completely independent spanning trees in \(k\)-th power of graphs (Q1649915) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← 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)
- Completely independent spanning trees in (partial) \(k\)-trees (Q2516669) (← links)
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees (Q2798238) (← links)
- (Q4953342) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- Completely independent spanning trees in the underlying graph of a line digraph (Q5936061) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Completely independent spanning trees in line graphs (Q6133659) (← links)