Status of Graceful Tree Conjecture in 1989-Reference-Cited by-同舟云学术

Status of Graceful Tree Conjecture in 1989

Published:1990 Issue: Volume: Page:175-184
ISSN:
Container-title:Topics in Combinatorics and Graph Theory
language:
Short-container-title:

Author:

Cahit I.

Publisher

Physica-Verlag HD

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-46908-4_20.pdf

Reference12 articles.

1. G. Ringel, Problem 25 in: Theory of Graphs and its Applications,(Proc. Internat. Sympos. Smolenice 1963 Nakl. CSAV, Praha 1964, p. 162.

2. A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs (Proc. Internat. Sympos. Rome 1966 ), Gordon and Breach-Dunod, N.Y.-Paris 1967, pp. 349–355.

3. S.W. Golomb, How to number of a graph, in: Graph Theory and Computing (ed. R.C. Read ), Academic Press, N.Y. (1972), pp. 23–37.

4. G.S. Bloom, A chronolgy of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful, in: Topics in Graph Theory (Annal of the N.Y. Academy of Sciences, 328,ed. F. Harary ), N.Y., 1979,pp. 32–51.

5. J.C.-Bermond, Graceful graphs, radio antennae and French windmills, in: Proc. of Open Univ. Conf., May 1978, ( Pitman, London 1979 ),pp. 13–37.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmic implementation of signed product and total signed product cordial labeling on complex graph;Journal of Intelligent & Fuzzy Systems;2019-09-09

2. Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path;Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics;2019-07-03

3. Trees having an even or quasi even degree sequence are graceful;Applied Mathematics Letters;2007-04