A degree characterisation of pancyclicity (Q1322211): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q189414 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Derek Holton / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pancyclic graphs. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A cycle structure theorem for Hamiltonian graphs / rank | |||
Normal rank | |||
Revision as of 15:32, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A degree characterisation of pancyclicity |
scientific article |
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
