A basis for the cycle space of a 2-connected graph (Q753834)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4181372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A basis for the cycle space of a 2-connected graph |
scientific article; zbMATH DE number 4181372 |
Statements
A basis for the cycle space of a 2-connected graph (English)
0 references
1985
0 references
This note contains a short proof of the result of \textit{I. B.-A. Hartman} [Eur. J. Comb. 4, 237-246 (1983; Zbl 0521.05039)] that the cycles of length at least \(d+1\) in any 2-connected graph of minimum degree at least d generate the cycle space, unless d is odd and the graph is isomorphic to \(K_{d+1}\).
0 references
0.832943320274353
0 references
0.832943320274353
0 references
0.7605882883071899
0 references
