Completely Independent Spanning Trees in Line Graphs

Completely independent spanning trees in a graph G are spanning trees of G such that for any two distinct vertices of G , the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint. In this paper, we present a tight lower bound on the maximum number of com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2023-10, Vol.39 (5), Article 90
1. Verfasser:	Hasunuma, Toru
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Completeness Engineering Design Graph theory Graphs Lower bounds Mathematics Mathematics and Statistics Original Paper Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!