Two edge-disjoint Hamiltonian cycles in graphs
type: Item
instance of: scholarly article
title: Two edge-disjoint Hamiltonian cycles in graphs
zbMATH Open document ID: 0807.05048
DOI: 10.1007/BF02986661
published in: Graphs and Combinatorics
publication date: 1994-09-26T00:00:00Z
review text: It is shown that if a graph is 2-connected of order \(n\geq 40\) with minimum degree of the graph \(\geq 7\) and \(d(u)+ d(v)\geq n-1\) for every pair of nonadjacent vertices \(u\) and \(v\), then the graph has two edge- disjoint Hamiltonian cycles unless it is one of two special graphs, and this conclusion is best possible.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 644734
zbMATH Keywords: connectivity
zbMATH Keywords: edge-disjoint Hamiltonian cycles
author: Mingchu Li
MaRDI profile type: Publication
cites work: Q3097395
cites work: Q3701452
cites work: Q5628163
cites work: Q3699724
Recommended article: Q4282956
Recommended article: Two edge-disjoint Hamiltonian cycles of powers of a graph
Recommended article: Edge-disjoint Hamilton cycles in graphs
Recommended article: Q4294607
Recommended article: Edge disjoint Hamilton cycles in graphs
Recommended article: Two edge-disjoint hamiltonian cycles in the butterfly graph
Recommended article: Q3701452
Recommended article: Q4262231
Recommended article: Disjoint Hamiltonian cycles in bipartite graphs
Recommended article: Edge disjoint Hamilton cycles in Knödel graphs
description: scientific article; zbMATH DE number 644734