Decomposition of some planar graphs into trees (Q1916140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposition of some planar graphs into trees |
scientific article; zbMATH DE number 896026
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of some planar graphs into trees |
scientific article; zbMATH DE number 896026 |
Statements
Decomposition of some planar graphs into trees (English)
0 references
13 January 1997
0 references
The author proves that if \(G\) is a quadrangulation of the plane and \(u\) and \(v\) are two nonadjacent vertices of \(G\), then \(G\) is the union of two edge-disjoint trees such that one is a spanning tree of \(G-u\) and the other is a spanning tree of \(G-v\).
0 references
quadrangulation
0 references
edge-disjoint tree
0 references
spanning tree
0 references
