A sufficient condition for a graph to contain two disjoint Hamiltonian cycles
type: Item
instance of: scholarly article
title: A sufficient condition for a graph to contain two disjoint Hamiltonian cycles
zbMATH Open document ID: 0703.05039
DOI: 10.1007/BF02941377
author: Sein Win
published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
publication date: 1988-01-01T00:00:00Z
review text: There is proved the following main result which generalizes Ore's theorem: Let G be a graph with n vertices and let \(d_ G(x)\) denote the degree of the vertex x in G; if \(n\geq 5\) and \(d_ G(x)+d_ G(y)\geq n+2\) holds for all nonadjacent vertices \(x\neq y\) of G, then G contains two disjoint Hamiltonian cycles. The proof is based on Ore's theorem and three lemmata.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4152418
zbMATH Keywords: graph
zbMATH Keywords: disjoint Hamiltonian cycles
reviewed by: Günter Schaar
MaRDI profile type: Publication
cites work: Arc coverings of graphs
cites work: Hamilton connected graphs
cites work: Hamiltonian Properties in the Graphs of Ore-Type-(k )
cites work: A sufficient condition for a graph to contain three disjoint 1-factors
full work available at URL: https://doi.org/10.1007/bf02941377
OpenAlex ID: W2042921428
Recommended article: Q3800077
Recommended article: Q4030530
Recommended article: Q4392123
Recommended article: Q3317137
Recommended article: Q4000801
Recommended article: Two edge-disjoint Hamiltonian cycles in graphs
Recommended article: Q3035325
Recommended article: Q4852568
Recommended article: Q3781787
Recommended article: Q4693690
description: scientific article; zbMATH DE number 4152418