On 2-regular subgraphs in polyhedral graphs (Q1613472)
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: On 2-regular subgraphs in polyhedral graphs |
scientific article; zbMATH DE number 1792402
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On 2-regular subgraphs in polyhedral graphs |
scientific article; zbMATH DE number 1792402 |
Statements
On 2-regular subgraphs in polyhedral graphs (English)
0 references
29 August 2002
0 references
The author proves that every \(3\)-connected planar graph \(G\) contains a \(2\)-regular subgraph \(U\) such that each component of \(G-U\) is a tree with at most three endvertices.
0 references
