On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
type: Item
instance of: scholarly article
title: On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
zbMATH Open document ID: 1378.05113
author: Shuya Chiba
publication date: 2018-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6827181
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: 2-factors
zbMATH Keywords: vertex-disjoint cycles
zbMATH Keywords: degree sum conditions
MaRDI profile type: Publication
full work available at URL: j.endm.2017.06.044
OpenAlex ID: W2743238865
cites work: An improvement of fraisse's sufficient condition for hamiltonian graphs
cites work: A remark on two sufficient conditions for Hamilton cycles
cites work: Degree conditions for 2-factors
cites work: Chvátal Erdős condition and 2-factors with a specyfied number of components
cites work: The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition
cites work: On degree sum conditions for 2-factors with a prescribed number of cycles
cites work: A note on Hamiltonian circuits
cites work: Q3577833
cites work: On the existence of disjoint cycles in a graph
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
cites work: Note on Hamilton Circuits
cites work: On the maximum number of independent cycles in a graph
cites work: On degree sum conditions for long cycles and cycles through specified vertices
DOI: 10.1016/J.ENDM.2017.06.044
description: scientific article; zbMATH DE number 6827181