A graph is
hamiltonian-connected if every pair of vertices can be connected by a
hamiltonian path, and it is
hamiltonian if it contains a hamiltonian cycle. We
construct families of nonhamiltonian graphs for which the ratio of pairs of vertices
connected by hamiltonian paths to all pairs of vertices approaches 1. We then
consider minimal graphs that are hamiltonian-connected. It is known that any
order-
graph that is hamiltonian-connected must have
edges.
We construct an infinite family of graphs realizing this minimum.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.158
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.