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 defining (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.
Type de document :
Pré-publication, Document de travail
2017
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01476364
Contributeur : Nicolas Gastineau <>
Soumis le : vendredi 24 février 2017 - 18:06:35
Dernière modification le : mardi 28 février 2017 - 01:05:26
Document(s) archivé(s) le : jeudi 25 mai 2017 - 14:20:16

Fichiers

journal.hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01476364, version 1
  • ARXIV : 1702.08289

Collections

Citation

Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. 2017. 〈hal-01476364〉

Partager

Métriques

Consultations de
la notice

122

Téléchargements du document

22