Degree sums, \(k\)-factors and Hamilton cycles in graphs

DOI10.1007/BF01787418zbMath0819.05041OpenAlexW2915468939MaRDI QIDQ1805370

Ralph J. Faudree, Jan van den Heuvel

Publication date: 27 August 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787418

zbMATH Keywords

Hamiltoniandegree sumHamilton cycles\(k\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Long cycles in graphs containing a 2-factor with many odd components, Hamiltonian cycles in n‐extendable graphs, \(k\)-factors and Hamilton cycles in graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, 2-factors and Hamiltonicity

Cites Work

• Long cycles in graphs with large degree sums
• Tough graphs and Hamiltonian circuits.
• Note on Hamilton Circuits
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• The binding number of a graph and its Anderson number
• Unnamed Item
• Unnamed Item