Independent cycles with limited size in a graph
type: Item
instance of: scholarly article
title: Independent cycles with limited size in a graph
zbMATH Open document ID: 0814.05052
DOI: 10.1007/BF02986677
author: Hong Wang
published in: Graphs and Combinatorics
publication date: 1995-06-08T00:00:00Z
review text: The following generalization of a result of \textit{K. Corrádi} and \textit{A. Hajnal} [Acta Math. Acad. Sci. Hung. 14, 423-439 (1963; Zbl 0118.190)] is proved. Let \(k\) and \(s\) be two positive integers with \(s\geq 3\). Let \(G\) be a graph of order \(n\geq sk\) and define \(q\) and \(r\) by \(n= qk+ r\), \(0\leq r\leq k-1\). Then, if \(G\) has minimum degree at least \((s- 1)k\), it contains \(k\) independent cycles \(C_ 1, C_ 2,\dots, C_ k\) such that the length of \(C_ i\) is inclusively between \(s\) and \(q\) for \(1\leq i\leq k- r\) and inclusively between \(s\) and \(q+ 1\) for \(k- r< i\leq k\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 700944
zbMATH Keywords: independent cycles
reviewed by: R. C. Entringer
MaRDI profile type: Publication
cites work: Q3852212
cites work: On the maximal number of independent circuits in a graph
cites work: Q5620621
full work available at URL: https://doi.org/10.1007/bf02986677
OpenAlex ID: W1978458814
description: scientific article; zbMATH DE number 700944