On a problem of Hendry

DOI10.1016/0012-365X(92)90356-KMaRDI QIDQ1193441zbMATH OpenOpenAlexFDO

Authors M. R. Hart, Xingxing Yu

Publication date 27 September 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90356-k

zbMATH Keywords

Hamiltonian cycleHamiltonian pathshomogeneously traceable graphproblem of Hendry

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

\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.

Recommendations

• Queries
• On a problem of Hornik
• scientific article; zbMATH DE number 800059
• On a problem of Hayman
• On a problem of Hajdu and Tengely
• On a problem of H. Berens
• scientific article; zbMATH DE number 1979718
• On a problem of Hardy and Littlewood
• scientific article; zbMATH DE number 3107278
• On a problem of Harary

Cites work

• Hamiltonian path graphs

Cited in

(3)

• Regular homogeneously traceable nonhamiltonian graphs
• Research problems
• Further results on Hendry's Conjecture

This page was built for publication: On a problem of Hendry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193441)