Hostname: page-component-77c89778f8-vsgnj Total loading time: 0 Render date: 2024-07-22T14:31:46.844Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Problem of Ore

Published online by Cambridge University Press:  03 November 2016

J. W. Moon
J. W. Moon*
Affiliation:
Mathematics Department, University of Alberta, Edmonton, Alberta, Canada
Get access Rights & Permissions [Opens in a new window]

Extract

A graph consists of a set of vertices some pairs of which are joined by a single edge. A path is a sequence of distinct vertices (x1, x2, …, xm) such that consecutive vertices xi and xi+1 are joined by an edge (xi, xi+1), for i = 1, 2, .., m — 1. One of the unsolved problems of graph theory is to obtain criteria for determining whether any given graph has a Hamilton path, i.e., a path which passes through each vertex exactly once. (For pertinent references and further definitions, see [1].)

Type
Research Article
Information
The Mathematical Gazette , Volume 49 , Issue 367 , February 1965 , pp. 40 - 41
Copyright
Copyright © Mathematical Association 1965

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Ore, O., Theory of Graphs, A.M.S. Collog. Publ., Vol. 38, 1962.Google Scholar
2. Ore, O., Hamilton connected graphs, J Math. Pures Appl., Vol. 42, 1963, pp. 21–27.Google Scholar