{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:15:23Z","timestamp":1747282523834,"version":"3.40.5"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030766566"},{"type":"electronic","value":"9783030766573"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-76657-3_22","type":"book-chapter","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T20:02:23Z","timestamp":1621108943000},"page":"312-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Properties of Unique Degree Sequences of 3-Uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"Michela","family":"Ascolese","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Frosini","sequence":"additional","affiliation":[]},{"given":"William Lawrence","family":"Kocay","sequence":"additional","affiliation":[]},{"given":"Lama","family":"Tarsissi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Behrens, S., et al.: New results on degree sequences of uniform hypergraphs. Electron. J. Comb. 20(4), P14 (2013)","DOI":"10.37236\/3414"},{"key":"22_CR2","unstructured":"Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-32360-2_7","volume-title":"Discrete Geometry for Computer Imagery","author":"S Brlek","year":"2016","unstructured":"Brlek, S., Frosini, A.: A tomographical interpretation of a sufficient condition on h-graphical sequences. In: Normand, N., Gu\u00e9don, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 95\u2013104. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32360-2_7"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(86)90028-4","volume":"14","author":"CJ Colbourne","year":"1986","unstructured":"Colbourne, C.J., Kocay, W.L., Stinson, D.R.: Some NP-complete problems for hypergraph degree sequences. Discrete Appl. Math. 14, 239\u2013254 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1090\/S0002-9939-1975-0384610-1","volume":"53","author":"AK Dewdney","year":"1975","unstructured":"Dewdney, A.K.: Degree sequences in complexes and hypergraphs. Proc. Amer. Math. Soc. 53(2), 535\u2013540 (1975)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1137\/17M1134482","volume":"32","author":"A Deza","year":"2018","unstructured":"Deza, A., Levin, A., Meesum, S.M., Onn, S.: Optimization over degree sequences. SIAM J. Disc. Math. 32(3), 2067\u20132079 (2018)","journal-title":"SIAM J. Disc. Math."},{"key":"22_CR7","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Math. Lapok. 11, 264\u2013274 (1960)","journal-title":"Math. Lapok."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-51466-2_20","volume-title":"Beyond the Horizon of Computability","author":"A Frosini","year":"2020","unstructured":"Frosini, A., Palma, G., Rinaldi, S.: Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind arrays. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 228\u2013238. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_20"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-37067-0_26","volume-title":"Discrete Geometry for Computer Imagery","author":"A Frosini","year":"2013","unstructured":"Frosini, A., Picouleau, C., Rinaldi, S.: On the degree sequences of uniform hypergraphs. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 300\u2013310. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37067-0_26"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S Hakimi","year":"1962","unstructured":"Hakimi, S.: On realizability of a set of integers as degrees of the vertices of a lineargraph. I. J. Soc. Indust. Appl. Math. 10, 496\u2013506 (1962)","journal-title":"I. J. Soc. Indust. Appl. Math."},{"key":"22_CR11","doi-asserted-by":"publisher","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 (in Czech). \u010casopis. P\u011bst. Mat. 80, 477\u2013480 (1955)","journal-title":"\u010casopis. P\u011bst. Mat."},{"key":"22_CR12","first-page":"145","volume":"82","author":"W Kocay","year":"2006","unstructured":"Kocay, W., Li, P.C.: On 3-hypergraphs with equal degree sequences. Ars Combinatoria 82, 145\u2013157 (2006)","journal-title":"Ars Combinatoria"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76657-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:03:19Z","timestamp":1747260199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76657-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030766566","9783030766573"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76657-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dgmm2021.se\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1,3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}