Another cycle structure theorem for Hamiltonian graphs
type: Item
instance of: scholarly article
title: Another cycle structure theorem for Hamiltonian graphs
zbMATH Open document ID: 0923.05037
DOI: 10.1016/S0012-365X(98)00336-7
author: Ren Han
published in: Discrete Mathematics
publication date: 1999-10-25T00:00:00Z
review text: This paper shows that for a Hamiltonian graph \(G\) of order \(n\), if non-adjacent vertices \(x\) and \(y\) of distance 2 on a Hamiltonian cycle satisfy \(d(x)+d(y)\geq n\), then \(G\) is either pancyclic or bipartite except only for the \(n-1\)-cycle and the 3-cycle \((d(x)\) is the degree of \(x\) and \(d(y)\) of \(y\)).
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1321809
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: pancyclic graph
zbMATH Keywords: cycle
reviewed by: Yanpei Liu
MaRDI profile type: Publication
cites work: Q5422499
cites work: Q3852212
cites work: A cycle structure theorem for Hamiltonian graphs
description: scientific article; zbMATH DE number 1321809