A Structural Property of Trees with an Application to Vertex-Arboricity

A Structural Property of Trees with an Application to Vertex-Arboricity

We provide a structural property of trees, which is applied to show that if a plane graph G contains two edge-disjoint spanning trees, then its dual graph G⁎ has the vertex-arboricity at most 2. We also show that every maximal plane graph of order at least 4 contains two edge-disjoint spanning trees...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical problems in engineering 2017-01, Vol.2017 (2017), p.1-3
Hauptverfasser: Wang, Ming-jia, Han, Jing-ti
Format: Artikel
Sprache:eng
Schlagworte:
Graph theory
Graphs
Hypotheses
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We provide a structural property of trees, which is applied to show that if a plane graph G contains two edge-disjoint spanning trees, then its dual graph G⁎ has the vertex-arboricity at most 2. We also show that every maximal plane graph of order at least 4 contains two edge-disjoint spanning trees.
ISSN:1024-123X
1563-5147
DOI:10.1155/2017/4259810