A structural property of trees with an application to vertex-arboricity
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.
scientific article; zbMATH DE number 6972090