No abstract

A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin.

No abstract

Let G be a finite group. We show that if |G| = pqrs, where p, q, r, and s are distinct odd primes, then every connected Cayley graph on G has a hamiltonian cycle.

In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.