{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:13Z","timestamp":1725567073281},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_69","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"680-689","source":"Crossref","is-referenced-by-count":0,"title":["Optimally Balanced Forward Degree Sequence"],"prefix":"10.1007","author":[{"given":"Xiaomin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, New York (1998)"},{"key":"69_CR2","first-page":"264","volume":"11","author":"P. Erdos","year":"1960","unstructured":"Erdos, P., Gallai, T.: Graphs with Prescribed Degrees of Vertices, Mat. Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Lapok"},{"key":"69_CR3","first-page":"496","volume":"10","author":"S. Hakimi","year":"1962","unstructured":"Hakimi, S.: On the Realizability of a Set of Integers as Degrees of the Vertices of a Graph SIAM J. Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"Appl. Math."},{"key":"69_CR4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: A Remark on the Existence of Finite Graphs. Casopis Pest. Mat.\u00a080, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"key":"69_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","volume-title":"Group-Theoretic Algorithms and Graph Isomorphism","author":"C.M. Hoffmann","year":"1982","unstructured":"Hoffmann, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol.\u00a0136. Springer, Heidelberg (1982)"},{"key":"69_CR6","first-page":"42","volume-title":"Proc. of the 21st Annual Symposium on Foundations of Computing","author":"E.M. Luks","year":"1980","unstructured":"Luks, E.M.: Isomorphism of bounded valence can be tested in polynomial time. In: Proc. of the 21st Annual Symposium on Foundations of Computing, pp. 42\u201349. IEEE, Los Alamitos (1980)"},{"key":"69_CR7","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, New Jersey (1996)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T23:10:11Z","timestamp":1626563411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11533719_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}