The longest cycles in a graph G with minimum degree at least \(| G| /k\) (Q1118613)
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: The longest cycles in a graph G with minimum degree at least \(| G| /k\) |
scientific article; zbMATH DE number 4095503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest cycles in a graph G with minimum degree at least \(| G| /k\) |
scientific article; zbMATH DE number 4095503 |
Statements
The longest cycles in a graph G with minimum degree at least \(| G| /k\) (English)
0 references
1989
0 references
This article shows that if \(d_ G(x)+d_ G(y)\geq \lceil 2| V(G)| /k\rceil\) for any nonadjacent distinct vertices x and y of V(G), then G has a cycle of length at least \(\lceil | V(G)| /(k- 1)\rceil\).
0 references
circumference
0 references
cycle
0 references
