# Long cycles in 3-cyclable graphs

D. Bauer, L. Mcguire, H. Trommel, H.J. Veldman

Research output: Book/ReportReportOther research output

## 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 Enschede University of Twente, Department of Applied Mathematics Published - 1998

• MSC-05C45
• MSC-05C38
• EWI-3254
• MSC-05C35