A degree characterisation of pancyclicity
type: Item
instance of: scholarly article
title: A degree characterisation of pancyclicity
zbMATH Open document ID: 0805.05067
DOI: 10.1016/0012-365X(92)00464-3
author: R. E. L. Aldred
author: Zhang Ke Min
author: Derek Holton
published in: Discrete Mathematics
publication date: 1995-01-26T00:00:00Z
review text: 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.
reviewed by: R. E. L. Aldred
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 562616
zbMATH Keywords: pancyclicity
zbMATH Keywords: degree
zbMATH Keywords: Ore condition
zbMATH Keywords: characterisation
MaRDI profile type: Publication
cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
cites work: Pancyclic graphs. I
cites work: Note on Hamilton Circuits
cites work: A cycle structure theorem for Hamiltonian graphs
full work available at URL: 0012-365x(92)00464-3
OpenAlex ID: W2066216526
description: scientific article; zbMATH DE number 562616