Hamilton Cycles in Cubic Graphs
نویسندگان
چکیده
A graph is cubic if each of its vertex is of degree 3 and it is hamiltonian if it contains a cycle passing through all its vertices. It is known that if a cubic graph is hamiltonian, then it has at least three Hamilton cycles. This paper is about those works done concerning the number of Hamilton cycles in cubic graphs and related problems.
منابع مشابه
Heuristic search for Hamilton cycles in cubic graphs
A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS
متن کاملOn Hamilton cycles in cubic (m, n)-metacirculant graphs, II
continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every...
متن کاملOn Hamilton cycles in cubic (m, n)-metacirculant graphs
Connected cubic (m,n)-metacircu1ant graphs, other than the Petersen , have been to be hamiltonian for m m divisible by 4 and m = 2. In this paper we two sufficient conditions tor connected cubic-metac1rcu1ant with m even, than 2 and not divisible by 4 to be hamiltonian. As corQ1laries, we show that every connected cubic-metacircu1ant other than the Petersen ,has a Hamilton if anyone of the cond...
متن کاملHamilton cycles and paths in vertex-transitive graphs - Current directions
In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given. © 2009 Elsevier B.V. All rights reserved. 1. Historical motivation In 1969, Lovász [59] asked whether every finite connected vertex-transitive graph has a Hamilton path, that is, a simple path going through all vertices, thus tying toge...
متن کاملHamilton cycles containing randomly selected edges in random regular graphs
In previous papers the authors showed that almost all d-regular graphs for d ≥ 3 are hamiltonian. In the present paper this result is generalized so that a set of j oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton cycle almost surely ...
متن کامل