A survey: Recent results, conjectures, and open problems in labeling graphs

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.

[1]  David A. Sheppard,et al.  The factorial representation of balanced labelled graphs , 1976, Discret. Math..

[2]  Charles Delorme,et al.  Cycles with a chord are graceful , 1980, J. Graph Theory.

[3]  Charles Delorme,et al.  Two sets of graceful graphs , 1980, J. Graph Theory.

[4]  Solomon W. Golomb,et al.  HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. , 1972 .

[5]  Maryvonne Mahéo.  Strongly graceful graphs , 1980, Discret. Math..

[6]  Thom Grace,et al.  On sequential labelings of graphs , 1983, J. Graph Theory.

[7]  Anton Kotzig,et al.  Decompositions of complete graphs into isomorphic cubes , 1981, J. Comb. Theory, Ser. B.

[8]  D. F. Hsu,et al.  On graceful directed graphs that are computational models of some algebraic systems , 1985 .

[9]  D. Frank Hsu.  Harmonious labelings of windmill graphs and related graphs , 1982, J. Graph Theory.

[10]  Peter J. SLATER,et al.  On k-graceful, countably infinite graphs , 1986, Discret. Math..

[11]  Roberto Frucht,et al.  GRACEFUL NUMBERING OF WHEELS AND RELATED GRAPHS , 1979 .

[12]  D. F. Hsu,et al.  On Graceful Directed Graphs , 1985 .

[13]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[14]  N. J. A. Sloane,et al.  On Additive Bases and Harmonious Graphs , 1980, SIAM J. Algebraic Discret. Methods.

[15]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[16]  Solomon W. Golomb,et al.  Numbered complete graphs, unusual rulers, and assorted applications , 1978 .

[17]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[18]  Peter J. Slater.  On k-graceful, locally finite graphs , 1983, J. Comb. Theory, Ser. B.

[19]  J. M. Weiss.  Psychological factors in stress and disease. , 1972, Scientific American.

[20]  G. Bloom.  A CHRONOLOGY OF THE RINGEL‐KOTZIG CONJECTURE AND THE CONTINUING QUEST TO CALL ALL TREES GRACEFUL * , 1979 .