Trees and Euler Tours in a Planar Graph and its Relatives (Q3764167)
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 4021163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trees and Euler Tours in a Planar Graph and its Relatives |
scientific article; zbMATH DE number 4021163 |
Statements
Trees and Euler Tours in a Planar Graph and its Relatives (English)
0 references
1987
0 references
planar graph
0 references
dual graph
0 references
medial graph
0 references
spanning trees
0 references
Euler tours
0 references
0.8327865600585938
0 references
0.7669593691825867
0 references
0.7660892009735107
0 references
Let G be a planar graph and consider the dual graph and the medial graph of G. (The latter is obtained by inserting a vertex in each edge of G.) The paper gives a review of proofs of the fact that the numbers of spanning trees of G, of spanning trees of the dual, of directed Euler tours of the medial and of arborescences of the medial are all equal.
0 references