A sufficient condition guaranteeing large cycles in graphs

DOI10.1016/S0012-365X(96)00110-0MaRDI QIDQ1357752zbMATH OpenFDO

Authors Ladislav Stacho

Publication date 4 November 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00110-0

zbMATH Keywords

long cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

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.

Recommendations

• Cycles in graphs of fixed girth with large size
• Maximal cycles in graphs of large girth
• New sufficient conditions for cycles in graphs
• Long cycles in certain graphs of large degree
• Cycles in graphs with large independence ratio
• A sufficient condition for cyclability in directed graphs
• scientific article; zbMATH DE number 4127255
• A sufficient condition for dominating cycles
• Long cycles in graphs with large degree sums
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem

Cites work

• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Large cycles in graphs
• Old Hamiltonian Ideas from a New Point of View

Cited in

(3)

• scientific article; zbMATH DE number 4127255 (Why is no real title available?)
• Large cycles in generalized Johnson graphs
• New sufficient conditions for cycles in graphs

This page was built for publication: A sufficient condition guaranteeing large cycles in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357752)