Proc. Conf., Sundance/Utah 1985, Congr. Numerantium 50, 231-241 (1985).
[For the entire collection see Zbl 0583.00003.]
This paper is a further one dealing with labeling graphs. The author considers edge-graceful graphs being defined as follows: A connected graph is said to be edge-graceful if, and only if, there is an edge-labeling of such that the weights
for each vertex are consecutive integers ranging from 0 to . Analogously to the theory of the graceful graphs the author derives some properties of edge- graceful graphs, proves a necessary condition for a graph to be edge- graceful, determines some classes of edge-graceful graphs, and finishes with the conjecture: Each complete graph is edge-graceful.