Degree sums,k-factors and hamilton cycles in graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1995 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 11, pages 21-28 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: Ralph J. Faudree; Jan van den Heuvel;

doi: 10.1007/bf01787418

Degree sums,k-factors and hamilton cycles in graphs

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

University of Memphis
United States
University of Twente
Netherlands

Keywords

Eulerian and Hamiltonian graphs, Connectivity, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), degree sum, \(k\)-factor, Hamilton cycles, Hamiltonian

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average