Proof of the strong 2-cover conjecture for planar graphs (Q1072568): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q594869 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Saul Stahl / rank | |||
Normal rank | |||
Revision as of 06:22, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of the strong 2-cover conjecture for planar graphs |
scientific article |
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
