Hamiltonicity in balanced \(k\)-partite graphs
type: Item
instance of: scholarly article
title: Hamiltonicity in balanced \(k\)-partite graphs
zbMATH Open document ID: 0833.05056
DOI: 10.1007/BF01793008
published in: Graphs and Combinatorics
publication date: 1995-11-29T00:00:00Z
review text: Let \(G\) denote a balanced \(k\)-partite graph with \(kn\) nodes. The authors show that \(G\) contains a hamiltonian cycle if its minimum node-degree exceeds \((k/2- 1/(k+ 1))n\) or \((k/2- 2/(k+ 2))n\), according as \(k\) is odd or even.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 811342
zbMATH Keywords: hamiltonicity
zbMATH Keywords: balanced \(k\)-partite graph
zbMATH Keywords: hamiltonian cycle
author: Guantao Chen
author: Ralph Faudree
author: Ronald Gould
author: Michael Jacobson
author: Linda Lesniak
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Some Theorems on Abstract Graphs
cites work: On Hamiltonian bipartite graphs
cites work: Note on Hamilton Circuits
full work available at URL: https://doi.org/10.1007/bf01793008
OpenAlex ID: W167540395
description: scientific article; zbMATH DE number 811342