论文信息 - Open Problems in Grid Labeling - 字舞流文

Open Problems in Grid Labeling

Joseph A. Gallian

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

[2] I. Cahit,et al. Are All Complete Binary Trees Graceful , 1976 .

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

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

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

[6] 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 .

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

[8] Solomon W. Golomb. The Largest Graceful Subgraph of the Complete Graph , 1974 .