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

DOI10.1007/S00373-017-1840-1MaRDI QIDQ1684941zbMATH OpenOpenAlexFDO

Authors A. Nevo, D. Bauer, E. 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-factorbest monotone degree conditionsHamiltonian cycle

Mathematics Subject Classification ID

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

Recommendations

• A degree condition for graphs to have Hamiltonian (g,f)-factors
• Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• Best monotone degree conditions for graph properties: a survey
• Implicit degree condition for Hamiltonicity of 2-heavy graphs
• A degree condition for Hamiltonian digraphs
• scientific article; zbMATH DE number 5130728
• An implicit degree condition for Hamiltonian graphs
• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• Degree conditions for k‐ordered hamiltonian graphs

Cites work

• Best monotone degree conditions for binding number and cycle structure
• Best monotone degree conditions for graph properties: a survey
• Degree sequences and the existence of k-factors
• Graphs \& digraphs
• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• scientific article; zbMATH DE number 3353326 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• On Hamilton's ideals
• Some Theorems on Abstract Graphs
• The strongest monotone degree condition for \(n\)-connectedness of a graph

Cited in

(4)

• Best monotone degree condition for 1-binding graphs to contain a 1-factor
• Best monotone degree conditions for binding number and cycle structure
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Best monotone degree conditions for binding number

This page was built for publication: Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684941)