Hamiltonian degree conditions for tough graphs
type: Item
instance of: scholarly article
title: Hamiltonian degree conditions for tough graphs
zbMATH Open document ID: 0854.05071
DOI: 10.1016/0012-365X(93)E0214-O
author: Chính T. Hoàng
published in: Discrete Mathematics
publication date: 1995-08-27T00:00:00Z
review text: Let \(G\) be a graph with degree sequence \(d_1, d_2,\dots, d_n\) and \(t\) a positive integer. It is shown that if \(G\) is \(t\)-tough and for any \(i\) with \(t\leq i< n/2\) we have \(d_i\leq i\Rightarrow d_{n- i+ 1}\geq n- i\), then \(G\) is hamiltonian. This result generalizes a theorem of Chvátal for the case \(t= 1\). A similar sufficient condition is obtained for pancyclicity of graphs.
reviewed by: Hao Li
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 790755
zbMATH Keywords: tough graphs
zbMATH Keywords: degree sequence
zbMATH Keywords: hamiltonian
zbMATH Keywords: pancyclicity
MaRDI profile type: Publication
cites work: Pancyclic graphs. I
cites work: A method in graph theory
cites work: On Hamilton's ideals
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q3689218
cites work: Toughness and the existence ofk-factors
cites work: Pancyclism and small cycles in graphs
cites work: On Maximal Circuits in Finite Graphs
cites work: Pancyclic graphs and a conjecture of Bondy and Chvatal
cites work: A cycle structure theorem for Hamiltonian graphs
full work available at URL: 0012-365x(93)e0214-o
OpenAlex ID: W1983807136
description: scientific article; zbMATH DE number 790755