{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:09:26Z","timestamp":1772273366702,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1007\/bf01275671","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T08:07:14Z","timestamp":1111651634000},"page":"369-382","source":"Crossref","is-referenced-by-count":100,"title":["Asymptotic enumeration by degree sequence of graphs with degreeso(n 1\/2)"],"prefix":"10.1007","volume":"11","author":[{"given":"Brendan D.","family":"McKay","sequence":"first","affiliation":[]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"15","volume":"19A","author":"B. D. McKay","year":"1985","unstructured":"B. D. McKay: Asymptotics for symmetric 0?1 matrices with prescribed row sums,Ars Combinatoria,19A (1985) 15?25.","journal-title":"Ars Combinatoria"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02579144","volume":"4","author":"B. D. McKay","year":"1984","unstructured":"B. D. McKay, andN. C. Wormald: Automorphisms of random graphs with specified degrees,Combinatorica,4 (1984) 325?338.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0195-6698(13)80042-X","volume":"11","author":"B. D. McKay","year":"1990","unstructured":"B. D. McKay, andN. C. Wormald: Asymptotic enumeration by degree sequence of graphs of high degree,European J. Combinatorics,11 (1990) 565?580.","journal-title":"European J. Combinatorics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","volume":"11","author":"B. D. McKay","year":"1990","unstructured":"B. D. McKay, andN. C. Wormald: Uniform generation of random regular graphs of moderate degree,J. Algorithms,11 (1990) 52?67.","journal-title":"J. Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01275671\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:15:09Z","timestamp":1556648109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01275671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01275671"],"URL":"https:\/\/doi.org\/10.1007\/bf01275671","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}