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...
Main Authors: | Ming-jia Wang, Jing-ti Han |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/4259810 |
Similar Items
-
A short proof of Brooks’ Theorem for vertex arboricity
by: Allan Bickle
Published: (2020-01-01) -
On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs
by: Fangyun Tao, et al.
Published: (2020-10-01) -
List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
by: Yanping Yang, et al.
Published: (2021-06-01) -
Arboreal Eloquence: Trees and
Commemoration
by: Morgan, Jo-anne Mary
Published: (2009) -
Vertex identification in trees
by: Yuya Kono, et al.
Published: (2021-07-01)