Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor

DOI10.1007/s00373-017-1840-1zbMath1376.05078OpenAlexW2745619053MaRDI QIDQ1684941

A. Nevo, Douglas Bauer, Edward F. Schmeichel

Publication date: 12 December 2017

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

Full work available at URL: https://doi.org/10.1007/s00373-017-1840-1

zbMATH Keywords

2-factorHamiltonian cyclebest monotone degree conditions

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

A Note of Generalization of Fractional ID-factor-critical Graphs

Cites Work

• Best monotone degree conditions for graph properties: a survey
• Best monotone degree conditions for binding number and cycle structure
• Degree sequences and the existence of \(k\)-factors
• On Hamilton's ideals
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item