Degree sums, \(k\)-factors and Hamilton cycles in graphs
type: Item
instance of: scholarly article
title: Degree sums, \(k\)-factors and Hamilton cycles in graphs
zbMATH Open document ID: 0819.05041
DOI: 10.1007/BF01787418
published in: Graphs and Combinatorics
publication date: 1995-08-27T00:00:00Z
review text: The paper proves that if a 2-connected graph on \(n\) nodes with every pair of nonadjacent nodes having degree sum at least \(n-k\) has a \(k\)-factor, then the graph is Hamiltonian. This is a generalization of well-known results of Ore and Jackson.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 754147
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: degree sum
zbMATH Keywords: \(k\)-factor
zbMATH Keywords: Hamiltonian
author: Ralph Faudree
author: Jan van den Heuvel
MaRDI profile type: Publication
cites work: Q3971997
cites work: Long cycles in graphs with large degree sums
cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
cites work: Q3097395
cites work: Tough graphs and Hamiltonian circuits.
cites work: Note on Hamilton Circuits
cites work: The binding number of a graph and its Anderson number
full work available at URL: https://doi.org/10.1007/bf01787418
OpenAlex ID: W2915468939
Recommended article: \(k\)-factors and Hamilton cycles in graphs
Recommended article: Hamiltonian ?-factors in graphs
Recommended article: Degree sums and path-factors in graphs
Recommended article: Q4873672
Recommended article: Degree sum and Hamiltonian-connected line graphs
Recommended article: Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
Recommended article: Q4780524
Recommended article: Q4677907
Recommended article: Degree sums, connectivity and dominating cycles in graphs
Recommended article: Q3773911
description: scientific article; zbMATH DE number 754147