{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:44:43Z","timestamp":1780386283558,"version":"3.54.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01202464","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:52:41Z","timestamp":1108741961000},"page":"1-10","source":"Crossref","is-referenced-by-count":6,"title":["Codings of graphs with binary edge labels"],"prefix":"10.1007","volume":"10","author":[{"given":"Martin","family":"Aigner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eberhard","family":"Triesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M. Aigner","year":"1990","unstructured":"Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discret Math.3, 439?449 (1990)","journal-title":"SIAM J. Discret Math"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Aigner, M., Triesch, E.: Irregular assignments and two problems \u00e0 la Ringel. In: Topics in combinatorics and graph theory (R. Bodendieck, R. Henn, eds.). Physics Verlag 1990, 29?36","DOI":"10.1007\/978-3-642-46908-4_2"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Golomb, S. W.: How to number a graph. In: Graph theory and computing (R.C. Read, ed.). Academic Press 1972, 23?37","DOI":"10.1016\/B978-1-4832-3187-7.50008-8"},{"key":"CR4","unstructured":"Hedge, S.M.: Set-sequential graphs. to be published"},{"key":"CR5","unstructured":"Lehel, J.: Facts and quests on degree irregular assignments. to be published"},{"key":"CR6","unstructured":"Ringel, G.: Problem No. 25. In: Theory of graphs and its applications. Proc. Symp. Smolenice 1963 (M. Fiedler, ed.). Publ. House Czech. Acad. Sciences 1964"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Tuza, Z.: Encoding the vertices of a graph with binary edge-labels. In: Sequences-combinatorics, compression, security and transmission (R.M. Capocelli, ed.). Springer-Verlag 1990, 287?299","DOI":"10.1007\/978-1-4612-3352-7_23"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:51Z","timestamp":1556730111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01202464"],"URL":"https:\/\/doi.org\/10.1007\/bf01202464","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}