A structural property of trees with an application to vertex-arboricity
type: Item
instance of: scholarly article
title: A structural property of trees with an application to vertex-arboricity
zbMATH Open document ID: 1426.05011
DOI: 10.1155/2017/4259810
author: Ming-jia Wang
author: Jing-ti Han
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: 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^\ast\) 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.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6972090
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/4259810
OpenAlex ID: W2624391775
Wikidata QID: Q59147542
cites work: The point-arboricity of a graph
cites work: The Point-Arboricity of Planar Graphs
cites work: An Analogue to the Heawood Map-Colouring Problem
cites work: Q4848759
cites work: List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
cites work: Vertex-arboricity of planar graphs without intersecting triangles
cites work: Vertex arboricity of planar graphs without chordal 6-cycles
cites work: On the vertex-arboricity of planar graphs
cites work: B-sets and planar maps
cites work: A Note on the Vertex Arboricity of a Graph
description: scientific article; zbMATH DE number 6972090