A structural property of trees with an application to vertex-arboricity (Q1992728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6972090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A structural property of trees with an application to vertex-arboricity |
scientific article; zbMATH DE number 6972090 |
Statements
A structural property of trees with an application to vertex-arboricity (English)
0 references
5 November 2018
0 references
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.
0 references
0.7935057878494263
0 references
0.7880041003227234
0 references
0.7875314950942993
0 references
0.7779064178466797
0 references
0.7752531170845032
0 references
