On the circumference of 3-connected graphs (Q1601399)

Estimates for the length of a longest cycle \(C\) in a 3-connected graph \(G\) are provided. If \(H\) is a component of \(G-C\) with \(|V(H)|\geq 3\), then there exist non-adjacent vertices \(u \in V(G)\) and \(v \in V(G)-V(C)\) such that \(|C|\geq 2d(u)+2d(v)-8\), provided the vertices of \(H\) have at least 4 neighbors. This estimate can be refined if we set additional conditions on \(H\).