Two counterexamples on completely independent spanning trees
From MaRDI portal
Publication:409435
DOI10.1016/J.DISC.2011.11.015zbMath1238.05060OpenAlexW2077515067WikidataQ124852142 ScholiaQ124852142MaRDI QIDQ409435
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.015
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (27)
Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Degree condition for completely independent spanning trees ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ 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 ⋮ Ore's condition for completely independent spanning trees ⋮ Comments on: ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ 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 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\)
Cites Work
This page was built for publication: Two counterexamples on completely independent spanning trees
