Cycle double covers of graphs with Hamilton paths (Q1089005)
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: Publication:1089005 |
scientific article; zbMATH DE number 4002129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycle double covers of graphs with Hamilton paths |
scientific article; zbMATH DE number 4002129 |
Statements
Cycle double covers of graphs with Hamilton paths (English)
0 references
1989
0 references
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.
0 references
cycle double cover
0 references
eulerian subgraphs
0 references
Hamilton path
0 references
0.8803448677062988
0 references
0.838054358959198
0 references
0.8357630968093872
0 references
0.8337331414222717
0 references
