Skip to Main content Skip to Navigation
Journal articles

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees

Abstract : The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-complete, for every two positive integers i and j. Moreover we prove that for square of graphs, k-connected interval graphs, complete graphs and several grids, there exist (i, j)-disjoint spanning trees for interesting values of i and j.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01715892
Contributor : Benoît Darties <>
Submitted on : Friday, February 23, 2018 - 10:21:20 AM
Last modification on : Monday, March 30, 2020 - 8:42:17 AM
Document(s) archivé(s) le : Thursday, May 24, 2018 - 2:18:24 PM

File

journal.pdf
Files produced by the author(s)

Identifiers

Citation

Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. Discrete Applied Mathematics, Elsevier, 2018, 236, pp.124-136. ⟨10.1016/j.dam.2017.11.018⟩. ⟨hal-01715892⟩

Share

Metrics

Record views

441

Files downloads

458