A sufficient condition guaranteeing large cycles in graphs (Q1357752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sufficient condition guaranteeing large cycles in graphs |
scientific article; zbMATH DE number 1021697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition guaranteeing large cycles in graphs |
scientific article; zbMATH DE number 1021697 |
Statements
A sufficient condition guaranteeing large cycles in graphs (English)
0 references
4 November 1997
0 references
\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.
0 references
long cycle
0 references
0.9276955
0 references
0.91635764
0 references
0.91620886
0 references
0.91283596
0 references
0.9125628
0 references
0.9110958
0 references
0.90869236
0 references
0.9057154
0 references
