2-connected spanning subgraphs of planar 3-connected graphs (Q1333340)
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: 2-connected spanning subgraphs of planar 3-connected graphs |
scientific article; zbMATH DE number 638661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-connected spanning subgraphs of planar 3-connected graphs |
scientific article; zbMATH DE number 638661 |
Statements
2-connected spanning subgraphs of planar 3-connected graphs (English)
0 references
20 March 1995
0 references
In 1966, the author proved that every 3-connected planar graph has a spanning subgraph that is a tree of maximum valency 3; see [Can. J. Math. 18, 731-736 (1966; Zbl 0141.214)]. The present paper contains a proof that in every 3-connected planar graph there is a 2-connected spanning subgraph of maximum valency 15. An example is given of a 3-connected planar graph with no 2-connected spanning subgraph of maximum valency 5.
0 references
spanning tree
0 references
planar graph
0 references
spanning subgraph
0 references
0.9571048
0 references
0.93232787
0 references
0.91238904
0 references
0.9081141
0 references
0 references
0.8950197
0 references
0.8949716
0 references
0.89318424
0 references
0.8916806
0 references
0.8891701
0 references
