Completely independent spanning trees in (partial) \(k\)-trees
From MaRDI portal
Publication:2516669
DOI10.7151/DMGT.1806zbMath1317.05029OpenAlexW2007726983MaRDI QIDQ2516669
Yota Otachi, Masayoshi Matsushita, Toru Araki
Publication date: 4 August 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1806
Related Items (11)
Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ A Hamilton sufficient condition for completely independent spanning tree ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Completely independent spanning trees in some regular graphs ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ 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
Cites Work
- Unnamed Item
- Two counterexamples on completely independent spanning trees
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- A partial k-arboretum of graphs with bounded treewidth
- Parameterized complexity of the spanning tree congestion problem
- Dirac's Condition for Completely Independent Spanning Trees
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Completely independent spanning trees in torus networks
- Completely independent spanning trees in the underlying graph of a line digraph
This page was built for publication: Completely independent spanning trees in (partial) \(k\)-trees
