Article contents
On Edge-Disjoint Cycles in a Graph
Published online by Cambridge University Press: 20 November 2018
Extract
Let g(k) denote the least integer such that every graph , with n vertices and n+g(k) edges, contains at least k edge-disjoint cycles; let h(k) be similarly defined for planar graphs. Loops and multiple edges (i.e., cycles of length one and two) are permitted in both cases.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1964
References
- 6
- Cited by