Proof of the strong 2-cover conjecture for planar graphs
type: Item
instance of: scholarly article
title: Proof of the strong 2-cover conjecture for planar graphs
zbMATH Open document ID: 0587.05041
DOI: 10.1016/0095-8956(86)90080-8
author: Herbert Fleischner
published in: Journal of Combinatorial Theory. Series B
publication date: 1986-01-01T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3941581
zbMATH Keywords: planar graph
zbMATH Keywords: 2-cover conjecture
zbMATH Keywords: edge-disjoint cycles
reviewed by: Saul Stahl
MaRDI profile type: Publication
full work available at URL: 0095-8956(86)90080-8
OpenAlex ID: W1988380304
cites work: Q3097395
cites work: Q3734435
description: scientific article; zbMATH DE number 3941581