Vertex-disjoint 4-cycles containing specified edges in a bipartite graph Original Research Article

Let C be a longest cycle in a connected graph G and image the length of the longest path in G. Suppose image, where image. It is known that image if G is image-connected, and image if G is k-connected. In this paper the exceptional classes for these estimates, when the connectivity is reduced by one, are essentially determined.