# Odd sums of long cycles in 2-connected graphs.

- Authors
- Keywords

## Abstract

Let G be a 2-connected graph with minimum degree d and with at least d + 2 vertices. Suppose that G is not a cycle. Then there is an odd set of cycles, each with length at least d + 1, such that they sum to zero. If G is also non-hamiltonian or bipartite, cycles of length at least $2d$ can be used.

## There are no comments yet on this publication. Be the first to share your thoughts.