{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:30:34Z","timestamp":1769005834003,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T00:00:00Z","timestamp":1483574400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00373-017-1757-8","type":"journal-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T16:52:13Z","timestamp":1483635133000},"page":"287-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved Bounds for Relaxed Graceful Trees"],"prefix":"10.1007","volume":"33","author":[{"given":"Christian","family":"Barrientos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0485-1430","authenticated-orcid":false,"given":"Elliot","family":"Krop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,5]]},"reference":[{"key":"1757_CR1","first-page":"18","volume-title":"Graph Theory and Combinatorics","author":"J-C Bermond","year":"1979","unstructured":"Bermond, J.-C.: Graceful graphs, radio antennae, and French windmills. In: Wilson, R.J. (ed.) Graph Theory and Combinatorics, pp. 18\u201337. Pitman Publishing Ltd., London (1979)"},{"issue":"1","key":"1757_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<7::AID-JGT2>3.0.CO;2-Y","volume":"31","author":"CP Bonnington","year":"1999","unstructured":"Bonnington, C.P., \u0160ir\u00e1\u0148, J.: Bipartite labeling of trees with maximum degree three. J. Graph Theory 31(1), 7\u201315 (1999)","journal-title":"J. Graph Theory"},{"key":"1757_CR3","first-page":"159","volume":"55","author":"L Brankovic","year":"2005","unstructured":"Brankovic, L., Rosa, A., \u0160ir\u00e1\u0148, J.: Labellings of trees with maximum degree three-an improved bound. J. Combin. Math. Combin. Comput. 55, 159\u2013169 (2005)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1757_CR4","first-page":"183","volume":"51","author":"HJ Broersma","year":"1999","unstructured":"Broersma, H.J., Hoede, C.: Another equivalent of the graceful tree conjecture. Ars Combin. 51, 183\u2013192 (1999)","journal-title":"Ars Combin."},{"key":"1757_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0012-365X(97)00069-1","volume":"181","author":"M Burzio","year":"1998","unstructured":"Burzio, M., Ferrarese, G.: The subdivision graph of a graceful tree is a graceful tree. Discrete Math. 181, 275\u2013281 (1998)","journal-title":"Discrete Math."},{"key":"1757_CR6","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Elec. J. Combin., DS6. (2015). http:\/\/www.combinatorics.org\/Surveys\/ds6 . Accessed on December 7"},{"key":"1757_CR7","doi-asserted-by":"crossref","unstructured":"Golomb, S.W.: How to number a graph, Graph Theory and Computing. In: Read, R.C. (ed.), pp. 23-37. Academic Press, New York (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50008-8"},{"key":"1757_CR8","first-page":"21","volume":"74","author":"E Krop","year":"2015","unstructured":"Krop, E.: Lobsters with an almost perfect matching are graceful. Bull. Inst. Combin. Appl. 74, 21\u201324 (2015)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1757_CR9","first-page":"82","volume":"53","author":"D Morgan","year":"2008","unstructured":"Morgan, D.: All lobsters with perfect matchings are graceful. Bull. Inst. Combin. Appl. 53, 82\u201386 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1757_CR10","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Sympos., Rome, 1966), pp. 349\u2013355. Gordon and Breach, New York (1967)"},{"issue":"2","key":"1757_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/jgt.3190190207","volume":"19","author":"A Rosa","year":"1995","unstructured":"Rosa, A., \u0160ir\u00e1\u0148, J.: Bipartite labelings of trees and the gracesize. J. Graph Theory 19(2), 201\u2013215 (1995)","journal-title":"J. Graph Theory"},{"key":"1757_CR12","unstructured":"Stanton, R., Zarnke, C.: Labeling of balanced trees. In: Proc. 4th Southeast Conf. Combin., Graph Theory, Comput., pp.\u00a0479\u2013495 (1973)"},{"key":"1757_CR13","unstructured":"Superdock, M.C.: The Graceful Tree Conjecture: A Class of Graceful Diameter-6 Trees, Senior Thesis, Department of Mathematics of Princeton University (2013)"},{"key":"1757_CR14","doi-asserted-by":"crossref","first-page":"R4","DOI":"10.37236\/1621","volume":"9","author":"F Bussel Van","year":"2002","unstructured":"Van Bussel, F.: Relaxed Graceful Labellings of Trees. Electron. J. Combin. 9, R4 (2002)","journal-title":"Electron. J. Combin."},{"key":"1757_CR15","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1757-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1757-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1757-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T19:29:11Z","timestamp":1658345351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1757-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,5]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1757"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1757-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,5]]}}}