Disjoint triangles and quadrilaterals in a graph Original Research Article

Let G be a simple graph of order n and s and k be two positive integers. Brandt et al. obtained the following result: If image, image and image, then G contains k disjoint cycles image satisfying image for image and image for image. In the above result, the length of image is not specified for image. We get a result specifying the length of image for each image if image.