Cahit, I.; Cahit, R. On the graceful numbering of spanning trees. (English) Zbl 0298.68033 Inf. Process. Lett. 3, 115-118 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 68W99 Algorithms in computer science 05C05 Trees PDFBibTeX XMLCite \textit{I. Cahit} and \textit{R. Cahit}, Inf. Process. Lett. 3, 115--118 (1975; Zbl 0298.68033) Full Text: DOI References: [1] Golomb, S. W., How to number a graph, (Read, R. C., Graph Theory and Computing (1972), Academic Press: Academic Press New York), 23-37 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.