On a problem of Hendry (Q1193441)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a problem of Hendry |
scientific article; zbMATH DE number 64630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a problem of Hendry |
scientific article; zbMATH DE number 64630 |
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
0 references
0 references
