Completely independent spanning trees in the underlying graph of a line digraph
From MaRDI portal
Publication:5936061
DOI10.1016/S0012-365X(00)00377-0zbMath0984.05022OpenAlexW1967548269WikidataQ126550366 ScholiaQ126550366MaRDI QIDQ5936061
Publication date: 2 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00377-0
Related Items (33)
Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Degree condition for completely independent spanning trees ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Completely independent spanning trees in \(k\)-th power of graphs ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Dirac's Condition for Completely Independent Spanning Trees ⋮ A Hamilton sufficient condition for completely independent spanning tree ⋮ Two completely independent spanning trees of claw-free graphs ⋮ Ore's condition for completely independent spanning trees ⋮ Two completely independent spanning trees of split graphs ⋮ Two counterexamples on completely independent spanning trees ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ Sufficient conditions for protection routing in IP networks ⋮ Two completely independent spanning trees of \(P_4\)-free graphs ⋮ Constructing dual-CISTs of folded divide-and-swap cubes ⋮ New comments on ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Completely independent spanning trees in torus networks ⋮ Completely independent spanning trees in some regular graphs ⋮ Structural properties of subdivided-line graphs ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Completely independent spanning trees in (partial) \(k\)-trees ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Degree conditions for completely independent spanning trees of bipartite graphs ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
This page was built for publication: Completely independent spanning trees in the underlying graph of a line digraph
