{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:24:35Z","timestamp":1759335875022},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90201-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"61-75","source":"Crossref","is-referenced-by-count":8,"title":["Decompositions into linear forests and difference labelings of graphs"],"prefix":"10.1016","volume":"49","author":[{"given":"Gary S.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90201-1_BIB1","series-title":"Graph Theory and Combinatorics","first-page":"18","article-title":"Graceful graphs, radio antennae, and French windmills","author":"Bermond","year":"1979"},{"key":"10.1016\/0166-218X(94)90201-1_BIB2","first-page":"32","article-title":"A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful","volume":"328","author":"Bloom","year":"1977"},{"key":"10.1016\/0166-218X(94)90201-1_BIB3","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/PROC.1977.10517","article-title":"Applications of numbered undirected graphs","volume":"65","author":"Bloom","year":"1977","journal-title":"Proc. IEEE"},{"key":"10.1016\/0166-218X(94)90201-1_BIB4","unstructured":"G.S. Bloom and S. Ruiz, Labeled graph decompositions of cycles into graphs, to appear."},{"key":"10.1016\/0166-218X(94)90201-1_BIB5","series-title":"Graph Theory and Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(94)90201-1_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The band-width problem for graphs and matrices","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90201-1_BIB7","article-title":"Labelings of graphs","volume":"III","author":"Chung","year":"1987"},{"key":"10.1016\/0166-218X(94)90201-1_BIB8","first-page":"417","article-title":"On good and equitable edge-colourings","volume":"17","author":"de Werra","year":"1975","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(94)90201-1_BIB9","first-page":"117","article-title":"Bandwidth versus bandsize","volume":"41","author":"Erd\u00f6s","year":"1989"},{"key":"10.1016\/0166-218X(94)90201-1_BIB10","doi-asserted-by":"crossref","unstructured":"J.A. Gallian, A survey - recent results, conjectures, and open problems in labeling graphs, J. Graph Theory, to appear.","DOI":"10.1002\/jgt.3190130410"},{"key":"10.1016\/0166-218X(94)90201-1_BIB11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity result for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Discrete Math."},{"key":"10.1016\/0166-218X(94)90201-1_BIB12","series-title":"Graph Theory and Computing","first-page":"23","article-title":"How to number a graph","author":"Golomb","year":"1972"},{"key":"10.1016\/0166-218X(94)90201-1_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01788550","article-title":"On the problem of bandsize","volume":"3","author":"Heinrich","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(94)90201-1_BIB14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(83)90041-0","article-title":"External f-trees and embedding spaces for molecular graphs","volume":"5","author":"Kennedy","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90201-1_BIB15","first-page":"181","article-title":"On d-graceful graphs","volume":"13","author":"Maheo","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(94)90201-1_BIB16","series-title":"Theory of Graphs","first-page":"349","article-title":"On certain valuations of the vertices of a graph","author":"Rosa","year":"1968"},{"key":"10.1016\/0166-218X(94)90201-1_BIB17","first-page":"53","article-title":"On k-graceful graphs","volume":"36","author":"Slater","year":"1982","journal-title":"Congr. Numer."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902011?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902011?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:03Z","timestamp":1555136823000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94902011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94902011"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90201-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}