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

Ming-jia Wang and Jing-ti Han

Mathematical Problems in Engineering, 2017, vol. 2017, 1-3

Abstract:

We provide a structural property of trees, which is applied to show that if a plane graph contains two edge-disjoint spanning trees, then its dual graph 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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/4259810.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/4259810.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4259810

DOI: 10.1155/2017/4259810

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().