Cycle double covers of graphs with Hamilton paths
type: Item
instance of: scholarly article
title: Cycle double covers of graphs with Hamilton paths
zbMATH Open document ID: 0618.05033
DOI: 10.1016/0095-8956(89)90048-8
author: Luis Goddyn
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: A k-cycle double cover of a graph G is a collection Z of at most k eulerian subgraphs of G such that every edge of G is an edge of exactly two subgraphs in Z. Presented is a short proof of the following theorem due to \textit{M. Tarsi} [``Semi-duality and the cycle double cover conjecture,'' J. Comb. Theory, Ser. B 41, 332-340 (1986; Zbl 0607.05019)]: Every bridgeless graph containing a Hamilton path has a 6- cycle double cover.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4002129
zbMATH Keywords: cycle double cover
zbMATH Keywords: eulerian subgraphs
zbMATH Keywords: Hamilton path
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90048-8
OpenAlex ID: W2091180746
cites work: Relative lengths of paths and cycles in 3-connected graphs
cites work: Q3710541
cites work: Semi-duality and the cycle double cover conjecture
cites work: Q3916595
cites work: Polyhedral decompositions of cubic graphs
description: scientific article; zbMATH DE number 4002129