{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:41Z","timestamp":1725500741287},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_26","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"274-285","source":"Crossref","is-referenced-by-count":0,"title":["On Directed Tree Realizations of Degree Sets"],"prefix":"10.1007","author":[{"given":"Prasun","family":"Kumar","sequence":"first","affiliation":[]},{"given":"M. N.","family":"Jayalal Sarma","sequence":"additional","affiliation":[]},{"given":"Saurabh","family":"Sawlani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895480194267932","volume":"9","author":"R. Arikati","year":"1996","unstructured":"Arikati, R., Srinavasa, Maheshwari, A.: Realizing degrees sequences in parallel. SIAM Journal of Discrete Mathematics\u00a09, 317\u2013338 (1996)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02019997","volume":"7","author":"G. Chartrand","year":"1976","unstructured":"Chartrand, G., Lesniak, L., Roberts, J.: Degree sets for digraphs. Periodica Mathematica Hungarica\u00a07, 77\u201385 (1976)","journal-title":"Periodica Mathematica Hungarica"},{"key":"26_CR3","first-page":"264","volume":"11","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs wiyh prescribed degrees of vertices. Mat. Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-17493-3_13","volume-title":"Parameterized and Exact Computation","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the Number of Numbers. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 123\u2013134. Springer, Heidelberg (2010)"},{"key":"26_CR5","unstructured":"Fernau, H.: Parameterized algorithms: A graph-theoretic approach. Technical report, Universit\u00e4t T\u00fcbingen, T\u00fcbingen, Germany (2005)"},{"key":"26_CR6","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag New York, Inc., Secaucus (2006)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10587-007-0042-z","volume":"57","author":"G. Gupta","year":"2007","unstructured":"Gupta, G., Joshi, P., Tripathi, A.: Graphic sequences of trees and a problem of frobenius. Czechoslovak Mathematical Journal\u00a057, 49\u201352 (2007)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"26_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-26677-0","volume-title":"Unsolved Problems in Number Theory, Unsolved Problems in Intuitive Mathematics","author":"R.K. Guy","year":"2004","unstructured":"Guy, R.K.: Unsolved Problems in Number Theory, Unsolved Problems in Intuitive Mathematics, 3rd edn., vol.\u00a0I. Springer, New York (2004)","edition":"3"},{"key":"26_CR9","first-page":"496","volume":"10","author":"S. Louis Hakimi","year":"1962","unstructured":"Louis Hakimi, S.: On realizability of a set of integers as degrees of the vertices of a linear graph i. SIAM Journal of Discrete Mathematics\u00a010, 496\u2013506 (1962)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: Eine bemerkung \u00fcber die existenz der endlichen graphen. \u0108asopis P\u00east. Mat.\u00a080, 477\u2013480 (1955)","journal-title":"\u0108asopis P\u00east. Mat."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.4064\/fm-95-3-189-194","volume":"95","author":"S.F. Kapoor","year":"1977","unstructured":"Kapoor, S.F., Polimeni, A.D., Wall, C.E.: Degree sets for graphs. Fundamental Mathematics\u00a095, 189\u2013194 (1977)","journal-title":"Fundamental Mathematics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T10:55:52Z","timestamp":1644144952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}