On a problem of Hendry (Q1193441)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a problem of Hendry |
scientific article |
Statements
On a problem of Hendry (English)
0 references
27 September 1992
0 references
\textit{G. R. T. Hendry} has conjectured that, in any homogeneously traceable graph, the number of pairs of vertices joined by Hamiltonian paths is at least the number of edges of the graph. The present authors observe that this holds in the special case where the graph has a Hamiltonian cycle.
0 references
problem of Hendry
0 references
homogeneously traceable graph
0 references
Hamiltonian paths
0 references
Hamiltonian cycle
0 references
