{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:08Z","timestamp":1725664148177},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_233","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:11:00Z","timestamp":1330261860000},"page":"38-47","source":"Crossref","is-referenced-by-count":5,"title":["Graphical degree sequence problems with connectivity requirements"],"prefix":"10.1007","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","unstructured":"C. Berge, Graphes et Hypergraphes, Dunod, 1970."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"5_CR3","first-page":"264","volume":"11","author":"P. Erd\u00f6s","year":"1960","unstructured":"P. Erd\u00f6s and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11 (1960), 264\u2013274.","journal-title":"Mat. Lapok"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S. Hakimi","year":"1962","unstructured":"S. Hakimi, On the realizability of a set of integers as degrees of the vertices of a graph, J. SIAM Appl. Math., 10 (1962), 496\u2013506.","journal-title":"J. SIAM Appl. Math."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Wesley, 1969.","DOI":"10.21236\/AD0705364"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"V. Havel, A remark on the existence of finite graphs (Hungarian), \u010dasopis P\u011ast. Mat., 80 (1955), 477\u2013480.","journal-title":"\u010dasopis P\u011ast. Mat."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.2140\/pjm.1970.33.203","volume":"33","author":"S.B. Rao","year":"1970","unstructured":"S.B. Rao and A. Ramachandra Rao, Existence of 3-connected graphs with prescribed degrees, Pac. J. Math., 33 (1970), 203\u2013207.","journal-title":"Pac. J. Math."},{"key":"5_CR8","unstructured":"M. Takahashi, K. Imai and T. Asano, Graphical Degree Sequence Problems, Technical Report TR93-AL-33-15, Information Processing Society of Japan, 1993."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"K. Thurlasirman and M.N.S. Swamy, Graphs: Theory and Algorithms, John Wilely & Sons, 1992.","DOI":"10.1002\/9781118033104"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, 6 (1977), 80\u201382.","journal-title":"Information Processing Letters"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas and E. Zijstra, Design and implementation of an effective priority queue, Math. System Theory, 10 (1977), 99\u2013127.","journal-title":"Math. System Theory"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/net.3230030303","volume":"3","author":"D.L. Wang","year":"1973","unstructured":"D.L. Wang and D.J. Kleitman, On the existence of n-Connected Graphs with Prescribed Degrees, Networks, 3 (1973), pp. 225\u2013239.","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_233.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:40:09Z","timestamp":1640929209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_233","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}