A sufficient condition guaranteeing large cycles in graphs
type: Item
instance of: scholarly article
title: A sufficient condition guaranteeing large cycles in graphs
zbMATH Open document ID: 0876.05055
DOI: 10.1016/S0012-365X(96)00110-0
author: Ladislav Stacho
published in: Discrete Mathematics
publication date: 1997-11-04T00:00:00Z
review text: \textit{P. Bedrossian, G. Chen} and \textit{R. H. Schelp} [Discrete Math. 115, No. 1-3, 39-50 (1993; Zbl 0773.05075)] gave a degree condition sufficient for the existence of long cycles in a graph \(G\). This paper improves their result by giving the condition in terms of \(\omega (G)\), an invariant described by examining neighbors of nonadjacent vertices that are part of an induced claw or modified claw.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1021697
zbMATH Keywords: long cycle
reviewed by: Norman F. Quimpo
MaRDI profile type: Publication
cites work: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
cites work: Large cycles in graphs
cites work: Old Hamiltonian Ideas from a New Point of View
Recommended article: Cycles in graphs of fixed girth with large size
Recommended article: Q5500372
Recommended article: New sufficient conditions for cycles in graphs
Recommended article: Long cycles in certain graphs of large degree
Recommended article: Cycles in graphs with large independence ratio
Recommended article: A sufficient condition for cyclability in directed graphs
Recommended article: Q4206768
Recommended article: A sufficient condition for dominating cycles
Recommended article: Long cycles in graphs with large degree sums
Recommended article: Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
description: scientific article; zbMATH DE number 1021697