On cycle-double covers of graphs of small oddness (Q5931449): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126310957, #quickstatements; #temporary_batch_1719528320554 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126310957 / rank | |||
Normal rank | |||
Latest revision as of 00:48, 28 June 2024
scientific article; zbMATH DE number 1591115
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cycle-double covers of graphs of small oddness |
scientific article; zbMATH DE number 1591115 |
Statements
On cycle-double covers of graphs of small oddness (English)
0 references
8 April 2002
0 references
The author proves the following theorems: Theorem 1. Each bridgeless graph of oddness at most 4 contains a 5-CDC. Theorem 2. Let \(G\) be a bridgeless graph containing a spanning connected subgraph \(G'\) with \(\omega(G')\leq 4\) (for instance, a Hamiltonian path or a spanning tree with at exactly 3 endvertices). Then \(G\) has a 5-CDC.
0 references
cycle-double covers
0 references
bridgeless graph
0 references
oddness
0 references
