{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:50:51Z","timestamp":1743148251010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_16","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"195-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Frosini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Picouleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-21073-0_27","volume-title":"Combinatorial Image Analysis","author":"E Barcucci","year":"2011","unstructured":"Barcucci, E., Brocchi, S., Frosini, A.: Solving the two color problem: an heuristic algorithm. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 298\u2013310. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21073-0_27"},{"issue":"4","key":"16_CR2","doi-asserted-by":"crossref","first-page":"P14","DOI":"10.37236\/3414","volume":"20","author":"S Behrens","year":"2013","unstructured":"Behrens, S., et al.: New results on degree sequences of uniform hypergraphs. Electron. J. Comb. 20(4), P14 (2013)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.7155\/jgaa.00178","volume":"13","author":"C Bentz","year":"2009","unstructured":"Bentz, C., Costa, M.-C., Picouleau, C., Ries, B., de Werra, D.: Degree-constrained edge partitioning in graphs arising from discrete tomography. J. Graph Algorithms Appl. 13(2), 99\u2013118 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR4","volume-title":"Graphs","author":"C Berge","year":"1983","unstructured":"Berge, C.: Graphs. Gauthier-Villars, Paris (1983)"},{"key":"16_CR5","volume-title":"Hypergraphs","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. North Holland, Amsterdam (1989)"},{"key":"16_CR6","first-page":"210","volume":"6","author":"T Brylawski","year":"1973","unstructured":"Brylawski, T.: The lattice of integer partitions. Discrete Math. 6, 210\u2013219 (1973)","journal-title":"Discrete Math."},{"key":"16_CR7","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":"16_CR8","doi-asserted-by":"publisher","first-page":"4795","DOI":"10.1016\/j.tcs.2010.08.004","volume":"412","author":"S Brocchi","year":"2011","unstructured":"Brocchi, S., Frosini, A., Rinaldi, S.: A reconstruction algorithm for a subclass of instances of the 2-color problem. Theor. Comput. Sci. 412, 4795\u20134804 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-04397-0_43","volume-title":"Discrete Geometry for Computer Imagery","author":"S Brocchi","year":"2009","unstructured":"Brocchi, S., Frosini, A., Rinaldi, S.: Solving some instances of the 2-color problem. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 505\u2013516. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04397-0_43"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-04397-0_45","volume-title":"Discrete Geometry for Computer Imagery","author":"S Brocchi","year":"2009","unstructured":"Brocchi, S., Frosini, A., Rinaldi, S.: The 1-color problem and the Brylawski model. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 530\u2013538. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04397-0_45"},{"key":"16_CR11","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":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.dam.2005.03.006","volume":"148","author":"M-C Costa","year":"2005","unstructured":"Costa, M.-C., de Werra, D., Picouleau, C., Schindl, D.: A solvable case of image reconstruction in discrete tomography. Discrete Appl. Math. 148(3), 240\u2013245 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.dam.2005.07.003","volume":"154","author":"M-C Costa","year":"2006","unstructured":"Costa, M.-C., de Werra, D., Picouleau, C.: Using graphs for some discrete tomography problems. Discrete Appl. Math. 154(1), 35\u201346 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1090\/S0002-9939-1975-0384610-1","volume":"53","author":"A Dewdney","year":"1975","unstructured":"Dewdney, A.: Degree sequences in complexes and hypergraphs. Proc. Am. Math. Soc. 53(2), 535\u2013540 (1975)","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"16_CR15","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. Discrete Math. 32(3), 2067\u20132079 (2018)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1137\/100799733","volume":"26","author":"C D\u00fcrr","year":"2012","unstructured":"D\u00fcrr, C., Gu\u00ed\u00f1ez, F., Matamala, M.: Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: a solution to the 2-atom problem in discrete tomography. SIAM J. Discrete Math. 26(1), 330\u2013352 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR17","first-page":"337","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P., Gallai, T.: On the maximal number of vertices representing the edges of a graph. MTA Mat. Kut. Int. K\u00f6zl. 6, 337\u2013357 (1961)","journal-title":"MTA Mat. Kut. Int. K\u00f6zl."},{"key":"16_CR18","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":"16_CR19","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. 7, 1073\u20131082 (1957)","journal-title":"Pacific J. Math."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2010.09.011","volume":"159","author":"F Gu\u00ed\u00f1ez","year":"2011","unstructured":"Gu\u00ed\u00f1ez, F., Matamala, M., Thomass\u00e9, S.: Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem. Discrete Appl. Math. 159(1), 23\u201330 (2011)","journal-title":"Discrete Appl. Math."},{"key":"16_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1568-4","volume-title":"Discrete Tomography: Foundations Algorithms and Applications","author":"GT Herman","year":"1999","unstructured":"Herman, G.T., Kuba, A.: Discrete Tomography: Foundations Algorithms and Applications. Birkhauser, Boston (1999)"},{"key":"16_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4543-4","volume-title":"Advances in Discrete Tomography and Its Applications","author":"GT Herman","year":"2007","unstructured":"Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkhauser, Boston (2007)"},{"key":"16_CR23","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"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"HJ Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371\u2013377 (1957)","journal-title":"Can. J. Math."},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190150209","volume":"15","author":"G Sierksma","year":"1991","unstructured":"Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph Theory 15(2), 223\u2013231 (1991)","journal-title":"J. Graph Theory"},{"issue":"18","key":"16_CR26","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.dam.2008.03.033","volume":"156","author":"A Tripathi","year":"2008","unstructured":"Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discrete Appl. Math. 156(18), 3513\u20133517 (2008)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:08:14Z","timestamp":1679188094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","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":"50","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":"38","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":"76% - 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-2","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}