Proof of the strong 2-cover conjecture for planar graphs (Q1072568)
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: Proof of the strong 2-cover conjecture for planar graphs |
scientific article; zbMATH DE number 3941581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of the strong 2-cover conjecture for planar graphs |
scientific article; zbMATH DE number 3941581 |
Statements
Proof of the strong 2-cover conjecture for planar graphs (English)
0 references
1986
0 references
The following theorem is proven without recourse to the four color theorem. Let \(G\) be a planar bridgeless graph, and let \(S_0=\{C_1,\dots,C_k\}\) be a set of edge-disjoint cycles of \(G\). Then there exists a 2-cover \(S\) of \(G\) with \(S_0\subset S\).
0 references
planar graph
0 references
2-cover conjecture
0 references
edge-disjoint cycles
0 references
