{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:21:04Z","timestamp":1649082064542},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf01271270","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T04:35:40Z","timestamp":1111638940000},"page":"521-525","source":"Crossref","is-referenced-by-count":0,"title":["Dense graphs and edge reconstruction"],"prefix":"10.1007","volume":"16","author":[{"given":"L.","family":"Pyber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"J. A. Bondy: A graph reconstructor's Manual, in Surveys in Combinatorics 1991, LMS, Lecture Note Series 166 (ed. A. Keedwell) Cambridge Univ. Press, 221?252.","DOI":"10.1017\/CBO9780511666216.009"},{"key":"CR2","first-page":"245","volume":"33","author":"C. R. J. Clapham","year":"1992","unstructured":"C. R. J. Clapham, andJ. Sheehan: Super-free graphs,Ars Combinatoria,33 (1992), 245?257.","journal-title":"Ars Combinatoria"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190120317","volume":"12","author":"M. N. Ellingham","year":"1988","unstructured":"M. N. Ellingham, L. Pyber, andX. Yu: Claw-free graphs are edge reconstructible,J. Graph Theory,12 (1988), 445?451.","journal-title":"J. Graph Theory"},{"key":"CR4","first-page":"295","volume":"49","author":"I. Krasikov","year":"1990","unstructured":"I. Krasikov: A note on the edge reconstruction ofK 1,m free graphs,JCT (B),49 (1990), 295?298.","journal-title":"JCT (B)"},{"key":"CR5","first-page":"309","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz: A note on the line reconstruction problem,JCT (B),13 (1972), 309?310.","journal-title":"JCT (B)"},{"key":"CR6","first-page":"281","volume":"22","author":"V. M\u00fcller","year":"1977","unstructured":"V. M\u00fcller: The edge reconstruction hypothesis is true for graphs with more thann logn edges,JCT (B),22 (1977), 281?283.","journal-title":"JCT (B)"},{"key":"CR7","unstructured":"C. St. J. A. Nash-Williams:The reconstruction problem in: Selected topics in graph theory, (1978) (eds. L. W. Beineke and R. J. Wilson) Acad. Press, 205?236."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/jgt.3190140205","volume":"14","author":"L. Pyber","year":"1990","unstructured":"L. Pyber: The edge reconstruction of Hamiltonian graphs,J. Graph Theory,14 (1990), 173?179.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01271270.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01271270\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01271270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T12:55:56Z","timestamp":1586177756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01271270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF01271270"],"URL":"https:\/\/doi.org\/10.1007\/bf01271270","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}