{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:03:35Z","timestamp":1787508215745,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229527","type":"print"},{"value":"9783642229534","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22953-4_23","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"264-275","source":"Crossref","is-referenced-by-count":5,"title":["Dag Realizations of Directed Degree Sequences"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"477","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs. Casopis Pest. Math.\u00a080, 477\u2013480 (1955)","journal-title":"Casopis Pest. Math."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","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 simple graph. J. SIAM Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"J. SIAM Appl. Math."},{"key":"23_CR3","first-page":"264","volume":"11","author":"S. Hakimi","year":"1960","unstructured":"Hakimi, S.: Graphs with prescribed degree of vertices (hungarian). Mat. Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D. Gale","year":"1957","unstructured":"Gale, D.: A theorem on flows in networks. Pacific J. Math.\u00a07, 1073\u20131082 (1957)","journal-title":"Pacific J. Math."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H. Ryser","year":"1957","unstructured":"Ryser, H.: Combinatorial properties of matrices of zeros and ones. Canad J. Math.\u00a09, 371\u2013377 (1957)","journal-title":"Canad J. Math."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"831","DOI":"10.2140\/pjm.1960.10.831","volume":"10","author":"D. Fulkerson","year":"1960","unstructured":"Fulkerson, D.: Zero-one matrices with zero trace. Pacific J. Math.\u00a010, 831\u2013836 (1960)","journal-title":"Pacific J. Math."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0016-0032(66)90301-2","volume":"281","author":"W.K. Chen","year":"1966","unstructured":"Chen, W.K.: On the realization of a (p,s)-digraph with prescribed degrees. Journal of the Franklin Institute\u00a0281, 406\u2013422 (1966)","journal-title":"Journal of the Franklin Institute"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","volume":"6","author":"D.J. Kleitman","year":"1973","unstructured":"Kleitman, D.J., Wang, D.L.: Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Mathematics\u00a06, 79\u201388 (1973)","journal-title":"Discrete Mathematics"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: Dag characterizations of directed degree sequences. Technical Report 2011\/6, Martin-Luther-Universit\u00e4t Halle-Wittenberg, Department of Computer Science (2011)","DOI":"10.1007\/978-3-642-22953-4_23"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02579180","volume":"1","author":"W.T. Tutte","year":"1981","unstructured":"Tutte, W.T.: Graph factors. Combinatorica\u00a01, 79\u201397 (1981)","journal-title":"Combinatorica"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0012-365X(73)90068-X","volume":"6","author":"S. Kundu","year":"1973","unstructured":"Kundu, S.: The k-factor conjecture is true. Discrete Mathematics\u00a06, 367\u2013376 (1973)","journal-title":"Discrete Mathematics"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: Dag realisations of directed degree sequences. Technical Report 2011\/5, Martin-Luther-Universit\u00e4t Halle-Wittenberg, Department of Computer Science (2011)","DOI":"10.1007\/978-3-642-22953-4_23"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:39:49Z","timestamp":1560469189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}