Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
type: Item
instance of: scholarly article
title: Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
zbMATH Open document ID: 0886.05087
DOI: 10.1007/BF03353011
author: Guantao Chen
author: Michael Jacobson
published in: Graphs and Combinatorics
publication date: 1998-04-08T00:00:00Z
review text: This paper provides a result on the Hamiltonicity of a balanced \(k\)-partite graph of order \(kn\) in terms of degree sums of each pair of nonadjacent vertices in different parts. That shows if the sum is greater than \((k-2/(k+1))n\), when \(k\equiv 1\pmod 2\), and \((k-4/(k+2))n\), when \(k\equiv 0\pmod 2\), then the graph is Hamiltonian.
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1106809
zbMATH Keywords: \(k\)-partite graph
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: degree sum
reviewed by: Yanpei Liu
MaRDI profile type: Publication
cites work: An improvement of fraisse's sufficient condition for hamiltonian graphs
cites work: Insertible vertices, neighborhood intersections, and hamiltonicity
cites work: A method in graph theory
cites work: Hamiltonicity in balanced \(k\)-partite graphs
cites work: Q4940054
cites work: Hamiltonicity for K1, r‐free graphs
cites work: Some Theorems on Abstract Graphs
cites work: Q4868770
cites work: On Hamiltonian bipartite graphs
cites work: Note on Hamilton Circuits
cites work: Hamilton cycles in claw-free graphs
description: scientific article; zbMATH DE number 1106809