JOURNAL OF GRAPH THEORY, VOL.

I, zyxw
zyx
zy 27-36 (1977)

L. LESNIAK-FOSTER
Louisiana Stare University

ABSTRACT
zyxwvu
Some Recent Results in Harniltonian Graphs”

A variety of recent developments in hamiltonian theory are reviewed. In particular,

several sufficient conditions for a graph to be hamiltonian, certain hamiltonian properties of
line graphs, and various hamiltonian properties of powers of graphs are discussed. Further-
more, the concept of an n-distant hamiltonian graph is introduced and several theorems
involving this special class of hamiltonian graphs are presented.

A graph G is defined to be hamiltonian if it has a cycle containing all

the vertices of G; such a cycle is called a hamiltonian cycle. The basic
unsolved problem of determining which graphs are hamiltonian has led to
the investigation of many related problems and, consequently, to the
development of what might generally be termed “hamiltonian theory”
(see [12, 15, 421). In this article we consider a sample of some of the
more recent results in the theory of hamiltonian graphs and provide the
reader with a large number of references to related results. Because of
the vast amount of research taking place in this area of graph theory,
several important topics in hamiltonian theory have necessarily been
omitted. Among these are hypohamiltonian graphs, the existence of
cycles o r paths in graphs, the decomposition of graphs into hamiltonian
zy
cycles, and hamiltonian directed graphs. We have restricted our attention
primarily to results involving sufficient conditions for a graph to be
hamiltonian and various hamiltonian properties of line graphs and powers
of graphs.
In view of the fact that no genuinely useful characterization of hamilto-
nian graphs exists or seems likely to be found, a good deal of effort has
been devoted to developing sufficient conditions for a graph to be
hamiltonian. Chronologically, Dirac [22], Ore [48], Pbsa [5 11, Bondy [5],
and Chvital[14] have determined such conditions in terms of the degrees

z
of the vertices of a graph, with each successive result strengthening those
preceding it.

* Invited address at the Special Session on Graph Theory of the January 1975 meeting of
the American Mathematical Society in Washington, D.C.
@ 1977 by John Wiley & Sons, Inc. 27
28

hamiltonian if:
1.
2.
3.
(Dirac)
(Ore)
(P6sa)
zyxwvu
zyxwvu
zyxw
zyxwv
zy
zyxwvu
zyxLESNIAK-FOSTER

A graph G of order p Z 3 with degree sequence d l S d2 5

1 5 k 5 p 3 dk 2 . ~ 1 2
uu& E ( G ).$ deg u +deg u L p
lSkCp12jdk>k
- * * S d p is

4. (Bondy) j<k, djSj, dksk-ljdj-t-dkep

5. (Chvital) dk 5 k C p / 2 3 dp-k L p - k.
A sequence d , S d Z S --- 5 dp is called graphic if it is the degree
sequence of agraph. If S : d 1 5 d S 5 . . . S d p and S * : d f S d T S . . . S d ;
are graphic sequences such that d * 2 di for 1 5 i 5 p , then S* is said to
majorize S. It is apparent that if a graphic sequence satisfies one of the
conditions stated above, then so does every graphic sequence which
majorizes it. The strength of ChvAtal’s result lies in the fact that it is the
best possible sufficient condition of this kind. Specifically, every graphic
sequence which fails to satisfy ( 5 ) is majorized by the sequence S* : d f 5
d f 5 . - - 5 d *p ,where d f = k for l S i i k , d : = p - k - l for k + l S i 5
p - k, and d: = p - 1 for p - k + 1 5 i S p . Moreover, S* is the degree
sequence of the graph K k + ( z k u Kp--2k),which is a nonhamiltonian
graph. Thus, if a graphic sequence fails to satisfy (5), then it is majorized
by the degree sequence of a nonhamiltonian graph. In particular, this
implies that Chvital’s result has those of Dirac, Ore, P6sa, and Bondy as
corollaries. (For applications of Chvital’s theorem, see [6,9,18].) It
should be pointed out that there are graphic sequences which do not
satisfy ( 5 ) but which are necessarily the degree sequences of hamiltonian
graphs. For example, Nash-Williams [41] proved that every ( ( p - 1)/2)-
regular graph of order p is hamiltonian. However, the degree sequence of
such a graph does not satisfy (5).
Although in the sense described above Chvital’s theorem is the
strongest possible, it has been generalized by Las Vergnas [37] and by
Bondy and Chvital [8].
The following sufficient condition of Las Vergnas has been shown to
apply whenever ( 5 ) does.

zyxwvut
6. (Las Vergnas). A graph G of order p L 3 is hamiltonian if the
vertices can be labeled ul, v 2 , . . . , up so that

j<k, klp-j,
vJuk‘ E(G)} deg Vj + deg u k 2 p .
deg uj d j, deg Uk 5 k - 1

Let G be a graph of order p and let k be an integer. Bondy and

Chvital define the k-closure of G, denoted C k ( G ) ,to be the smallest
 zyxw
zyxwvuts
zyxwv
zyxwvu
zy
zyxw
zyxwv
SOME RECENT RESULTS IN HAMILTONIAN GRAPHS

graph H of order p such that G is a (spanning) subgraph of H and

deg, u + degH u < k

for all nonadjacent vertices u and u of H. We then have a sufficient

condition in terms of the p-closure of a graph.
29

zy
7. (Bondy and Chvital). If G is a graph of order p Z 3 and C,(G) is
complete, then G is hamiltonian.
It can be shown that conditions (1)-(6) guarantee that C p ( G ) is
complete. Moreover, (7) is strictly stronger than all of these conditions.
For example, the graph G of Figure 1 is hamiltonian by (7) since
C6(G)= K6. However, there is no labeling u l , u2, . . . , z)6 of the vertices of
G that satisfies (6).
Bondy and Chvital have described a method for finding C,(G) for an
arbitrary graph G in O(p4) steps and, given a hamiltonian cycle in C p ( G ) ,
a method for finding a hamiltonian cycle in G within O(p3) steps.
Furthermore, they have shown that the method of proof involving the
closure of a graph may be applied in many other situations (by consider-
ing C k ( G )for various values of k), yielding sufficiency theorems for other
graphical properties.
Related to results involving the degrees of the vertices of a graph are
those involving the number of edges of the graph. A well known result of
this type is that due to Ore [47] which states that any graph of order p 1 3
with at least ( p z - 3 p + 6)/2 edges is hamiltonian. Recently, P6sa [50]
showed that, for a sufficiently large c, “almost all graphs of order p with
at least cp log p edges are hamiltonian.” Specifically, we have the
following.
(P6sa). There exists a constant c such that the probability that a
random graph with p vertices and cp log p edges is hamiltonian tends to
1 as p + w .

Figure 1
30 zyxwvut LESNIAK-FOSTER

zyxwvu
For a discussion of the maximum number of edges in a graph without

zy
hamiltonian cycles, see [7].

zyxw
Although most sufficient conditions for a graph to be hamiltonian

zyxwvut
involve the degrees of the vertices of the graph (the reader is referred to
[20, 21, 57, 601 for further examples), two recent results are given in
terms of the (vertex) connectivity of a graph. Chvrital and Erdos [17]

zyxwvu
proved the following sufficient condition involving the connectivity K ( G )
and the (vertex) independence number P(G) of a graph G (see also [33]
and [40, Lemma 41).
8. (Chvrital and Erdos). Let G be a graph with at least three vertices. If
K ( G) 2 P(G), then G is hamiltonian.

Although it is well known that a 3-connected planar graph need not be

hamiltonian, Tutte [59] proved that every 4-connected planar graph is
hamiltonian. Recently, Duke [23] showed that this result has an analogue
for graphs of higher genus. In particular, let c(m) denote the least integer

zyxw
such that every c(m)-connected graph of genus not exceeding m is
hamiltonian. Duke proved that such a function c ( m ) exists and has values
satisfying

+
[?(5 + (16m + 1)'12] d c( m) S (3 (6m + 3)'12}, m 2 1,

where {x} denotes the least integer L x and [x] denotes the greatest
integer S x .
Sufficient conditions depending upon the toughness of a graph [161 and
upon the binding number of a graph [61] have been obtained. Further
examples of sufficient conditions may be found in [19] and [56], where
hamiltonian cycles in tree-graphs are considered, and in [62]. The reader
is referred to [31, ch. 71, for Grinberg's condition for the nonexistence of
a hamiltonian cycle in a graph.
At this point it is convenient to define a variety of hamiltonian
properties which a graph may possess. (Several of these properties have
been incorporated into a single generalized notion by Skupien and Wojda
[58].) A graph G is called hamiltonian-connected if each pair of distinct

zyxwv
vertices of G is joined by a spanning path. It is immediate that every
hamiltonian-connected graph with at least three vertices is hamiltonian. A
graph G with p vertices is pancyclic if G has cycles of all lengths I,

zyxwv
3 S I S p ; if moreover, every vertex (edge) of G lies on a cycle of every
length, then G is uerrex (edge) pancyclic. Finally, let dG(u, u ) denote the
distance between vertices u and u of a connected graph G. Then a graph
G with p vertices is called panconnecred if for each pair u, u of distinct
vertices of G and for each 1 satisfying dG(u, u ) 5 1 S p - 1, there is a u - u
 zyxwvu
zyxw
zyxwvu
zyxwvu
SOME RECENT RESULTS IN HAMILTONIAN GRAPHS 31

zyx
path of length 1 in G. Every panconnected graph clearly possesses all of
the hamiltonian properties defined above.

zyxwvuts
With every graph G having at least one edge, there is associated a
graph L(G), called the line graph of G, whose vertices can be put in one-
to-one correspondence with the edges of G in such a way that two
vertices of L(G) are adjacent if and only if the corresponding edges of G
are adjacent. It was first shown by Sedlacek [54] that if G is hamiltonian,
then L ( G) is hamiltonian. Since then, many hamiltonian results involving
line graphs have been obtained. Several of the more recent are given
below.
(Nebeskf [45]). Let G be a graph with at least five vertices and let d
denote the complement of G. Then at least one of L(G) and L ( @ is
hamiltonian.
The nth power G" of a connected graph G is that graph having the
same vertex set as G and such that two distinct vertices u and u are
adjacent in G" if and only if the distance between them in G is at most n.
(Nebeskjr [44]). If G is a connected graph with at least four vertices,
then both L(GZ)and [L(G)I2 are hamiltonian.
Nebeskf's result involving [L(G)]' was obtained independently by
Rosenstiehl (see [52]) and then strengthened by Bermond and Rosen-
stiehl [2].
(Bermond and Rosenstiehl). If G is a connected graph with at least
four vertices, then [ L (G)]' is vertex pancyclic.
Additional results involving line graphs may be found in [13, 34, 64,
651.
In 1960, Sekanina [55] showed that the cube of every connected graph
is hamiltonian-connected (and thus hamiltonian). Independently, Beineke
discovered that the cube of a connected graph is hamiltonian and
Karaganis [35] rediscovered Sekanina's result (see [29]). Chartrand and
Kapoor [ll] then proved that if G is a connected graph with at least four
vertices, not only is G3 hamiltonian but it is also the case that the removal
of any vertex from G3 results in a hamiltonian graph, i.e., G3 is 1-
hamiltonian. Finally, Bondy [4] showed that the cube of every connected
graph is pancyclic and Alavi and Williamson [l] proved that such graphs
are, in fact, panconnected.
After the cube of every connected graph was shown to be hamiltonian,
it was conjectured independently by Plummer and Nash-Williams [43]
that for 2-connected graphs G, the graph G2 is hamiltonian. (It is not true
that the square of every connected graph is hamiltonian. For example,
32 zyxwvutzy
zyxwvu LESNIAK-FOSTER

Neuman [46] and Harary and Schwenk [28] characterized those trees T
for which T 2is hamiltonian. If T is a tree with at least three vertices, then

zy
7” is harniltonian if and only if T does not contain S(K(1,3)) as a
subgraph, where S(K(1,3)) is the graph obtained from K(1,3) by insert-
ing a new vertex of degree two into each edge of K(1,3).) This conjecture
remained open until it was verified by Fleischner [26] in 1971. A variety
of results strengthening (but employing) Fleischner’s work followed. For
example, Chartrand, Hobbs, Jung, Kapoor, and Nash-Williams [ 101

zyxw
showed that the square of every 2-connected graph with at least four
vertices is 1-hamiltonian. (Zaks [63] has shown that this result cannot be
improved to “2-hamiltonian.”) One of the most recent results concerning

zyxwv
the square of a 2-connected graph, due to Faudree and Schelp [25], states
that if G is 2-connected, then G2is panconnected. As corollaries of this
result we have that if G is a 2-connected graph, then
(i) (Chartrand, Hobbs, Jung, Kapoor, Nash-Williams [lo]) G 2 is
hamiltonian-connected,
(ii) (Hobbs [30]) G2 is vertex-pancyclic,
(iii) G2 is edge-pancyclic.
Detailed discussions involving powers of graphs may be found in [ 121 and
~321.
In [3], Bondy introduced the concept of a pancyclic graph and showed
that every hamiltonian graph with p vertices and at least p2/4 edges is
either pancyclic or is the complete bipartite graph K(p/2,p/2). Since a
graph satisfying Ore’s condition (2) is hamiltonian and has at least p2/4
edges, every graph of order p satisfying Ore’s condition is pancyclic or is
the graph K(p/2, p / 2 ) . This observation supports the “Metaconjecture”
which was made by Bondy
METACONJECTURE. Almost any nontrivial condition on a graph which

zyx
implies that the graph is hamiltonian also implies that the graph is
pancyclic. (There may be a simple family of exceptional graphs.)
Throughout this article we have seen several results in support of the
metaconjecture. We now state two further such results.

zyx
(Schmeichel and Hakimi [53]). If G is a graph of order p t3 such that

pancyclic or bipartite.
--
the degrees d l S d2S * s dp of the vertices satisfy ( 5 ) , then G is

(Erdos [24]). There is an absolute constant c such that if G has at

least ck4 vertices and ~ ( G ) z k z p ( G(in) particular, G satisfies (8)),
then G is pancyclic.
Additional results involving pancyclic graphs may be Eound in [4] and
[a.
 zy
zyxwvu
zyxwvut
SOME RECENT RESULTS IN HAMILTONIAN GRAPHS

In a somewhat negative vein, Bondy has shown the existence of graphs

G of order p for which C,(G) is complete but which fail to be pancyclic
or bipartite. Also, Malkevitch [39] has constructed an infinite class of
33

4-connected planar graphs, i.e., graphs satisfying Tutte's condition for a

zy
hamiltonian cycle, which are not pancyclic.
We now present three results, very recently obtained by Fleischner

zyx
[27], which are intimately related to the previous discussions.

is hamiltonian,

zyxw
(Fleischner). (i) The square of a graph G is pancyclic if and only if GZ

(ii) The square of a graph G con'tains a spanning path joining vertices

u and u if and only if there is a u - u path of length I in G 2 for
each I satisfying dG(u,u ) S IS 1 V( G)J- I,
(iii) The square of a graph is panconnected if and only if it is
hamiltonian-connected.
Thus in the squares of graphs, hamiltonianity and pancyclicity are
equivalent concepts, as are hamiltonian-connectedness and panconnec-
tedness.
We close our discussion with a final example of a variation on the
hamiltonian theme. If a graph is hamiltonian, then obviously every vertex
of the graph lies on a hamiltonian cycle. A hamiltonian graph may have
the added property that every edge of the graph lies on some hamiltonian
cycle. Such graphs have been referred to as 1-edge hamiltonian graphs
(see [ 3 6 , 4 9 ] ) . The concept of a 1-edge hamiltonian graph can be ex-

zyxwv
tended in the following manner. The diameter of a connected graph G,
denoted diam G, is the maximum distance between all pairs of vertices of
G. We say that G is n-distant hamiltonian (see [38]), 0 5 n Sdiam G, if
whenever u and u are vertices of G for which dG(u,u ) S n, there is a
hamiltonian cycle C of G such that dc(u, u ) = dG(u,u). Clearly, then, a
graph is 1-distant hamiltonian if and only if it is 1-edge-hamiltonian. It
can be shown that, for integers m and n satisfying 0 5 n 5 2m/3, there are
n-distant hamiltonian graphs G which are not ( n + 1)-distant hamiltonian
with diam G = m. For integers m and n satisfying 2 m l 3 < n C m , the
validity of an analogous statement is still being investigated. In the spirit
of the types of results presented throughout this article, we conclude with
the following results concerning n-distant hamiltonian graphs.
If G is a graph of order p Z 3 such that

uu& E ( G )3 deg u +deg u 2 p + 1,

then G is diam G-distant hamiltonian.
34 zyxwvut
zyxwv
zy
zyxw LESNIAK-FOSTER

If every vertex of a connected graph G has degree at least four, then

L ( L ( G ) )is diam L(L(G))-distant hamiltonian.
If G is a connected graph of order p 2 3, then G3 is diam G3-distant
hamiltonian.

REFERENCES zyxwvutsrq
The author is grateful to Professor J.-C. Bermond for his many helpful suggestions.

1. Y . Alavi and J. E. Williamson, Panconnected graphs. Studia Sci. Math. Hungar. (in

zy
zyxwvuts
press).

zyxw
2. J.-C. Bermond and P. Rosenstiehl, Le carrt du graphe reprisentatif des arctes de totit
multigraphe est pancyclique. Proc. Colloque sur la The'orie des Graphs 26-27 Auril
1973, Cahiers du C.E.R.O., Bruxelles 15 (1973) 285-286.
3. J. A. Bondy, Pancyclic graphs I. J. Comb. Theory I1B (1971) 80-84.
4. J. A. Bondy and A. W. Ingleton, Pancyclic graphs 11. J. Comb. Theory 20B (1976)
41-47.
5 , J. A. Bondy, Properties of graphs with constraints on degrees. Studia Sci. Math.
Hungar. 4 (1969) 473-475.
6. I. A. Bondy, Recent results on pancyclic graphs. Finite and Infinite Sets. North-Holland
(1975).
7. J. A. Bondy, Variations on the hamiltonian theme. Can. Math. Bull. 15 (1972) 57-62.
8. J. A. Bondy and V. Chvital, A method in graph theory. Discrete Math. 15 (1976)
111-135.
9. P. Camion, Hamiltonian chains in self-complementary graphs. Cahiers Centre Etudes
Recherche Oper., Bruxelles 17 (1975) 173-184.
10. G . Chartrand, A. M. Hobbs, H. A. Jung, S . F. Kapoor, and C. St. J. A. Nash-Williams,
The square of a block is hamiltonian connected. J. Comb. Theory 16B (1974) 290-292.
11. G. Chartrand and S. F. Kapoor, The cube of every connected graph is 1-hamiltonian. J.
Res. Nat. Bur. Stand. 73B (1969) 47-48.
12. G. Chartrand, S. F. Kapoor, and H. V: Kronk, The Hamiltonian Hierarchy. Western
Michigan University Math. Report 32, Kalamazoo (1973).
13. G . Chartrand and C. E. Walt, On the hamiltonian index of a graph. Studia Sci. Math.
Hungar. 8 (1973) 43-48.
14. V. Chvltal, On Hamilton's ideals. J. Comb. Theory 12B (1972) 163-168.
15. V. Chvltal, New directions in hamiltonian graph theory. New Directions in the Theory of
Graphs. Academic Press, New York and London (1973) 65-95.
16. V. Chvital, Tough graphs and hamiltonian circuits. Discrete Math. 5 (1973) 215-228.
17. V. Chvital and P. Erdos, A note on hamiltonian circuits. Discrete Math. 2 (1972)
111-113.
18. C. R. J. Clapham, Hamiltonian arcs in self-complementary graphs. Discrete Math. 8
(1974) 251-255.
19. R. L. Curnmins, Hamilton circuits in tree graphs. ZEEE Trans. Circuit Theory 13 (1966)
82-90.
20. G . A. Dirac, On Hamilton circuits and Hamilton paths. Math. Ann. 197 (1972) 57-70.'
21. G . A. Dirac, Note on hamilton circuits and hamilton paths. Mafh. Ann. 206 (1973)
139-147.
22. G . A. Dirac, Some theorems on abstract graphs. Proc. London Math. Soc. 2 (1952)
69-81.
 zyxzy
zyxw
zyxwvutsrqp SOME RECENT RESULTS IN HAMILTONIAN GRAPHS

23. R. A. Duke, On the genus and connectivity of hamiltonian graphs. Discrete Math. 2
(1972) 199-206.
35

(1974) 187-190.

zy
24. P. Erdos, Some problems in graph theory. Hypergraph Seminar. Springer-Verlag, Berlin

25. R. J. Faudree and R. H. Schelp, The square of a block is strongly path connected.
J. Comb. Theory. 20B (1976) 47-61.
26. H. Fleischner, The square of every two-connected graph is hamiltonian. J. Comb.
Theory 16B (1974) 29-34.
27. H. Fleischner, In the square of graphs, hamiltonianity and pancyclicity, hamiltonian
connectedness and panconnectedness are equivalent concepts (in press).
28. F. Harary and A. Schwenk, Trees with Hamiltonian square. Mathematika 18 (1971)
138-140.
29. A. M. Hobbs, Thesis: Hamiltonian Paths in Powers of Graphs. University of Waterloo
(1971).
30. A. M. Hobbs, The square of a block is vertex pancyclic. 1.Comb. Theory. 208 (1976) 1-4.
31. R. H. Honsberger, Mathematical Gems. Dolciani Math. Expositions No. I, M.A.A.
(1973).
32. J. L. Jolivet, Thesis. University of Paris VI (1975).
33. H. A. Jung, Note on hamiltonian graphs. Recent Advances in Graph Theory. Academia,
Publishing House of the Czechoslovak Academy of Sciences, Prague (1975) 3 15-321.
34. S. F. Kapoor and M. J. Stewart, A note on the hamiltonian index of a graph. Studia Sci.
Math. Hungar. 8 (1973) 307-308.
35. J. J. Karaganis, On the cube of a graph. Can. Math. Bull. 11 (1968) 295-296.
36. H. V. Kronk, Variations on a theorem of Pbsa. The Many Facets of Graph Theory.
Springer-Verlag, Berlin (1969) 193-197.
37. M. LasVergnas, Thesis. University of Paris VI (1972).

zyxwvuts
38. L. Lesniak, n-Distant hamiltonian graphs. UtilifasMath. 9 (1976) 161-175.
39. J. Malkevitch, On lengths of cycles in planar graphs. Recent Trends in Graph Theory.
Springer-Verlag, Berlin (1971) 191-195.
40. C. St. J. A. Nash-Williams, Edge-disjoint hamiltonian circuits in graphs with vertices of
large valency. Studies in Pure Mathematics, Academic Press, London (1971) 157-183.
41. C. St. J. A. Nash-Williams, Hamilton arcs and circuits. Recent Trends in Graph Theory.
Springer-Verlag, Berlin (1971) 197-210.
42. C. St. J. A. Nash-Williams, Hamiltonian circuits. Studies in Graph Theory, Part 11. MAA
Press (1975) 301-360.
43. C. St. J. A. Nash-Williams, Problem 48. Theory of Graphs. Academic Press, New York

zyxw
and London (1969) 367.
44. L. Nebeskjl, On the line graph of the square and the square of the line graph of a
connected graph. Casopis PZst. Mat. 98 (1973) 285-287.
45. L. Nebeskf, A theorem on hamiltonian line graphs. Commenr. Math. Uniu. Carolinae
14 (1973) 107-111.
46. F. Neumann, On a certain ordering of the vertices of a tree. Casopis Pest. Mat., 89
(1964) 323-339.
47. 0. Ore, Arc coverings of graphs. Ann. Mat. Pura Appl. 55 (1961) 315-322.
48. 0. Ore, Note on hamilton circuits. Amer. Math. Monfhly 67 (1960) 55.
49. L. Pbsa, On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kutatd Int. Kozl. 8
(1963) 355-361.
50. L. Pbsa, Hamiltonian circuits in random graphs. Discrefe Mafh. 14 (1976) 359-364.
51. L. Pbsa, A theorem concerning hamilton lines. Magyar Tud. Akad. Mar. Kutatd Inf.
Kiizl. 7 (1962) 225-226.
36

zyxwvutsrqp
zyzy
LESNIAK-FOSTER

52. P. Rosenstiehl, Labyrinthologie mathematique. Math. Sci. Humaines 33 (1971).

53. E. F. Schmeichel and S. L. Hakimi, Pancyclic graphs and a conjecture of Bondy and

zyxwv
zyx
Chvital. J. Comb. Theory 17B (1974) 22-34.
54. J. Sedlacek, Some properties of interchange graphs. Theory of Graphs and Its Ap-
plications. Academic Press, New York (1964) 145-150.
5 5 . M. Sekanina, On an ordering of the set of vertices of a connected graph. Publ. Fac. Sci.
Uniu. Brno 412 (1960) 137-142.
56. H. Shank, A note on Hamilton circuits in tree graphs. IEEE Trans. Circuit Theory 15
(1968) 86.
57. Z. Skupien, Sufficient conditions for hamiltonian graphs. Bull. Acad. Polon. Sci. Sir. Sci.
Marh. Astronom Phys. 19 (1971) 901-905.
58. Z. Skupien and A. P. Wojda, On highly hamiltonian graphs. Bull. Acad. Polon. Sci. Sir.
Sci. Math. Astronom. Phys. 22 (1974) 463-471.
59. W. T. Tutte, A theorem on planar graphs. Trans. Amer. Math. Soc. 82 (1956) 99-1 16.
60. A. P. Wojda, Sufficient conditions for a graph to be q-connected and q-edge hamilto-

zyx
nian. Bull. Acad. Polon. Sci. Sir. Sci. Marh. Astronom Phys. 22 (1974) 229-234.
61. D. R. Woodall, The binding number of a graph and its Anderson number. J. Comb.
Theory 15B (1973) 225-255.
62. D. R. Woodall, A sufficientcondition for hamiltonian circuits. J. Comb. Theory (in press).
63. J. Zaks, Non-hamiltonian square minus two. Elem Math. 29 (1974) 33-35.
64. T. Zamfirescu, On k-path hamiltonian graphs and line graphs. Rend. Sem. Mat. Uniu.
Padova 46 (1971) 385-389.
65. T. Zamfirescu, On k-path hamiltonian line graphs. Rend. 1st. Mat. Uniu. Trieste 4
(1972) 1-7.