Two edge-disjoint Hamiltonian cycles in graphs (Q1334943)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two edge-disjoint Hamiltonian cycles in graphs |
scientific article |
Statements
Two edge-disjoint Hamiltonian cycles in graphs (English)
0 references
26 September 1994
0 references
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.
0 references
connectivity
0 references
edge-disjoint Hamiltonian cycles
0 references