Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
type: Item
instance of: scholarly article
title: Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
zbMATH Open document ID: 1376.05078
author: A. Nevo
author: D. Bauer
author: E. Schmeichel
published in: Graphs and Combinatorics
publication date: 2017-12-12T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6817815
zbMATH Keywords: best monotone degree conditions
zbMATH Keywords: 2-factor
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
full work available at URL: s00373-017-1840-1
OpenAlex ID: W2745619053
cites work: Best monotone degree conditions for graph properties: a survey
cites work: Degree sequences and the existence of \(k\)-factors
cites work: Best monotone degree conditions for binding number and cycle structure
cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph
cites work: Q5576241
cites work: Q3065457
cites work: On Hamilton's ideals
cites work: Some Theorems on Abstract Graphs
cites work: Q5628162
cites work: Q5722819
DOI: 10.1007/S00373-017-1840-1
Recommended article: Q3054543
Recommended article: Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
Recommended article: Q2971216
Recommended article: Best monotone degree conditions for graph properties: a survey
Recommended article: Implicit degree condition for Hamiltonicity of 2-heavy graphs
Recommended article: A degree condition for Hamiltonian digraphs
Recommended article: Q3424775
Recommended article: An implicit degree condition for Hamiltonian graphs
Recommended article: An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
Recommended article: Degree conditions for k‐ordered hamiltonian graphs
description: scientific article; zbMATH DE number 6817815