{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:10Z","timestamp":1747541050995,"version":"3.40.5"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_21","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:30Z","timestamp":1747468050000},"page":"326-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Realizing Graphs with\u00a0Cut Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6506-4174","authenticated-orcid":false,"given":"V\u00edtor Gomes","family":"Chagas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5970-2984","authenticated-orcid":false,"given":"Samuel Pla\u00e7a","family":"de Paula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0112-8009","authenticated-orcid":false,"given":"Greis Yvet Oropeza","family":"Quesqu\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-5903","authenticated-orcid":false,"given":"Lucas","family":"de Oliveira Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton","family":"dos Santos Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"21_CR1","volume-title":"Combinatorial Search","author":"M Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. John Wiley & Sons Inc., Hoboken (1988)"},{"issue":"1\u20133","key":"21_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0012-365X(94)00104-Q","volume":"136","author":"M Aigner","year":"1994","unstructured":"Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Disc. Math. 136(1\u20133), 3\u201320 (1994)","journal-title":"Disc. Math."},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190090103","volume":"9","author":"J Akiyama","year":"1985","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs\u2013a survey. J. Graph Theory 9(1), 1\u201342 (1985)","journal-title":"J. Graph Theory"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"R Anstee","year":"1985","unstructured":"Anstee, R.: An algorithmic proof of tutte\u2019s f-factor theorem. J. Algor. 6(1), 112\u2013131 (1985)","journal-title":"J. Algor."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Apers, S., Efron, Y., Gawrychowski, P., Lee, T., Mukhopadhyay, S., Nanongkai, D.: Cut query algorithms with star contraction. In: FOCS 2022, pp. 507\u2013518 (2022)","DOI":"10.1109\/FOCS54457.2022.00055"},{"key":"21_CR6","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On realizing a single degree sequence by a bipartite graph. In: SWAT 2022 (2022)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2022.04.012","volume":"922","author":"A Bar-Noy","year":"2022","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. 922, 81\u201395 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2019.12.020","volume":"807","author":"A Bar-Noy","year":"2020","unstructured":"Bar-Noy, A., Peleg, D., Rawitz, D.: Vertex-weighted realizations of graphs. Theor. Comput. Sci. 807, 56\u201372 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C., Minieka, E.: Graphs and Hypergraphs. North-Holland Publishing Company, Amsterdam (1973)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1137\/15M102527X","volume":"31","author":"D Burstein","year":"2017","unstructured":"Burstein, D., Rubin, J.: Sufficient conditions for graphicality of bidegree sequences. SIAM J. Disc. Math. 31(1), 50\u201362 (2017)","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1515\/ausi-2015-0007","volume":"6","author":"BA Chat","year":"2014","unstructured":"Chat, B.A., Pirzada, S., Iv\u00e1nyi, A.: Recognition of split-graphic sequences. Acta Universitatis Sapientiae, Informatica 6(2), 252\u2013286 (2014)","journal-title":"Acta Universitatis Sapientiae, Informatica"},{"issue":"2\u20133","key":"21_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(87)90184-1","volume":"64","author":"AA Chernyak","year":"1987","unstructured":"Chernyak, A.A., Chernyak, Z.A., Tyshkevich, R.I.: On forcibly hereditary p-graphical sequences. Disc. Math. 64(2\u20133), 111\u2013128 (1987)","journal-title":"Disc. Math."},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S0004972700002872","volume":"33","author":"SA Choudum","year":"1986","unstructured":"Choudum, S.A.: A simple proof of the erdos-gallai theorem on graph sequences. Bull. Aust. Math. Soc. 33(1), 67\u201370 (1986)","journal-title":"Bull. Aust. Math. Soc."},{"key":"21_CR14","series-title":"Applied Mathematics","volume-title":"Combinatorial Group Testing and Its Applications","author":"D Du","year":"2000","unstructured":"Du, D., Hwang, F.: Combinatorial Group Testing and Its Applications. Applied Mathematics, World Scientific, Singapore (2000)"},{"key":"21_CR15","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Gr\u00e1fok el\u0151\u00edrt foksz\u00e1m\u00fa pontokkal. Mat. Lapok (N.S.) 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok (N.S.)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P.L., Hartke, S.G., Van\u00a0Iersel, L., Mikl\u00f3s, I.: Graph realizations constrained by skeleton graphs. Electron. J. Comb. 24(2) (2017)","DOI":"10.37236\/5459"},{"issue":"3","key":"21_CR17","first-page":"553","volume":"9","author":"PL Erd\u0151s","year":"2018","unstructured":"Erd\u0151s, P.L., Mikl\u00f3s, I.: Not all simple looking degree sequence problems are easy. J. Comb. 9(3), 553\u2013566 (2018)","journal-title":"J. Comb."},{"key":"21_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V Grebinski","year":"1998","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a hamiltonian cycle by querying the graph: application to dna physical mapping. Disc. Appl. Math. 88(1), 147\u2013165 (1998)","journal-title":"Disc. Appl. Math."},{"key":"21_CR20","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. Czechoslov. Math. J. 57, 49\u201352 (2007)","journal-title":"Czechoslov. Math. J."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Ind. Appl. Math. 10, 496\u2013506 (1962)","journal-title":"I. J. Soc. Ind. Appl. Math."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph theory. In: Clustering Algorithm, p.\u00a01975 (1969)","DOI":"10.21236\/AD0705364"},{"issue":"4","key":"21_CR24","doi-asserted-by":"publisher","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"080","author":"V Havel","year":"1955","unstructured":"Havel, V.: Pozn\u00e1mka o existenci kone\u010dn\u00fdch graf\u016f. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky 080(4), 477\u2013480 (1955)","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Iv\u00e1nyi, A.: Degree sequences of multigraphs. In: Annales University of Science Budapest., Security and Computation, vol.\u00a037, pp. 195\u2013214. ELTE (2012)","DOI":"10.71352\/ac.37.195"},{"issue":"3","key":"21_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0095-8956(76)80007-X","volume":"21","author":"M Koren","year":"1976","unstructured":"Koren, M.: Sequences with a unique realization by simple graphs. J. Comb. Theory Ser. B 21(3), 235\u2013244 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"21_CR27","unstructured":"Liao, H., Chakrabarty, D.: Learning spanning forests optimally in weighted undirected graphs with cut queries. In: Vernade, C., Hsu, D. (eds.) Proceedings of the 35th International Conference on Algorithmic Learning Theory. Proceedings of Machine Learning Research, vol.\u00a0237, pp. 785\u2013807. PMLR (2024)"},{"issue":"4","key":"21_CR28","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"8","author":"L Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: Subgraphs with prescribed valencies. J. Comb. Theory 8(4), 391\u2013416 (1970)","journal-title":"J. Comb. Theory"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol.\u00a012, pp. 321\u2013391. Elsevier (2005)","DOI":"10.1016\/S0927-0507(05)12007-6"},{"issue":"4","key":"21_CR30","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s00454-013-9545-6","volume":"50","author":"I Pak","year":"2013","unstructured":"Pak, I., Vilenchik, D.: Constructing uniquely realizable graphs. Disc. Comput. Geom. 50(4), 1051\u20131071 (2013)","journal-title":"Disc. Comput. Geom."},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1900","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1900)","journal-title":"Acta Math."},{"issue":"7","key":"21_CR32","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"MD Plummer","year":"2007","unstructured":"Plummer, M.D.: Graph factors and factorization: 1985\u20132003: a survey. Disc. Math. 307(7), 791\u2013821 (2007)","journal-title":"Disc. Math."},{"key":"21_CR33","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BFb0092288","volume-title":"Combinatorics and Graph Theory","author":"SB Rao","year":"1981","unstructured":"Rao, S.B.: A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences. In: Rao, S.B. (ed.) Combinatorics and Graph Theory. LNM, vol. 885, pp. 417\u2013440. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0092288"},{"issue":"18","key":"21_CR34","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. Disc. Appl. Math. 156(18), 3513\u20133517 (2008)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"21_CR35","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.disc.2009.09.023","volume":"310","author":"A Tripathi","year":"2010","unstructured":"Tripathi, A., Venugopalan, S., West, D.B.: A short constructive proof of the erd\u0151s-gallai characterization of graphic lists. Disc. Math. 310(4), 843\u2013844 (2010)","journal-title":"Disc. Math."},{"key":"21_CR36","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. J. Math. 4, 314\u2013328 (1952)","journal-title":"Can. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:36Z","timestamp":1747468056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}