On cycle-double covers of graphs of small oddness (Q5931449): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126310957 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00205-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077999329 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:56, 30 July 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
