A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
type: Item
instance of: scholarly article
title: A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
zbMATH Open document ID: 0930.05062
author: Bing Wei
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-02-09T00:00:00Z
review text: \textit{D. Bauer}, \textit{H. J. Broersma}, \textit{H. J. Veldman} and \textit{Li Rao} [J. Comb. Theory, Ser. B 47, No. 2, 237-243 (1989; Zbl 0634.05053)] proved that if \(G\) is a 2-connected graph with \(n\) vertices such that \(d(u)+ d(v)+ d(w)\geq n+\kappa\) holds for any triple of independent vertices \(u\), \(v\), and \(w\), then \(G\) is Hamiltonian, where \(\kappa\) is the vertex connectivity of \(G\). We give a short proof of the above result. \(\copyright\) Academic Press.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1347243
zbMATH Keywords: Hamiltonian
zbMATH Keywords: connectivity
MaRDI profile type: Publication
full work available at URL: jctb.1998.1867
OpenAlex ID: W1990780374
cites work: A generalization of a result of Häggkvist and Nicoghossian
cites work: A remark on Hamiltonian cycles
DOI: 10.1006/JCTB.1998.1867
Recommended article: Q4677907
Recommended article: A short proof of a theorem on Hamiltonian graphs
Recommended article: Degree sum and Hamiltonian-connected line graphs
Recommended article: A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
Recommended article: A short proof of a theorem on degree sets of graphs
Recommended article: Q4873672
Recommended article: Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
Recommended article: Q4029984
Recommended article: Sufficient conditions for some Hamiltonian properties and \(k\)-connectivity of graphs
Recommended article: The Hamiltonicity of \(k\)-connected \([s,t]\)-graphs.
description: scientific article; zbMATH DE number 1347243