A degree characterisation of pancyclicity (Q1322211)
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 degree characterisation of pancyclicity |
scientific article; zbMATH DE number 562616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A degree characterisation of pancyclicity |
scientific article; zbMATH DE number 562616 |
Statements
A degree characterisation of pancyclicity (English)
0 references
26 January 1995
0 references
A graph \(G\) of order \(n\) is said to be in the class \(O(n-1)\) if \(\deg (u) + \deg (v) \geq n - 1\) for every pair of nonadjacent vertices \(u\), \(v \in V(G)\). The paper presents a characterisation of those graphs in \(O(n-1)\) which are pancyclic.
0 references
pancyclicity
0 references
degree
0 references
Ore condition
0 references
characterisation
0 references
0.7905713319778442
0 references
