A degree characterisation of pancyclicity (Q1322211): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)00464-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066216526 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 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