Abstract
It is proven that if $G$ is a 3-cyclable graph on $n$ vertices, with minimum degree $\delta$ and with a maximum independent set of cardinality $\alpha$, then $G$ contains a cycle of length at least min\,$\{n,3\delta-3,n+\delta-\alpha\}$.
Original language | Undefined |
---|---|
Place of Publication | Enschede |
Publisher | University of Twente |
Publication status | Published - 1998 |
Keywords
- MSC-05C45
- MSC-05C38
- EWI-3254
- MSC-05C35