{"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":1747541050326,"version":"3.40.5"},"publisher-location":"Cham","reference-count":39,"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_17","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:24Z","timestamp":1747468044000},"page":"258-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree Realization by\u00a0Bipartite Cactus Graphs"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toni","family":"B\u00f6hnlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingli","family":"Ran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.disc.2018.10.013","volume":"342","author":"P Adams","year":"2019","unstructured":"Adams, P., Nikolayevsky, Y.: Planar bipartite biregular degree sequences. Discr. Math. 342, 433\u2013440 (2019)","journal-title":"Discr. Math."},{"key":"17_CR2","unstructured":"Agnarsson, G., Greenlaw, R.: Graph Theory: Modeling, Applications, and Algorithms. Prentice (2006)"},{"key":"17_CR3","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. Discr. Math. 136, 3\u201320 (1994)","journal-title":"Discr. Math."},{"issue":"12","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2766","DOI":"10.1109\/TAC.2011.2125130","volume":"56","author":"M Arcak","year":"2011","unstructured":"Arcak, M.: Diagonal stability on cactus graphs and application to network stability analysis. IEEE Trans. Autom. Control 56(12), 2766\u20132777 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"17_CR5","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Ran, Y., Rawitz, D.: On key parameters affecting the realizability of degree sequences. In: 49th MFCS. LIPIcs, vol. 306, pp. 1:1\u20131:16 (2024)"},{"key":"17_CR6","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Ran, Y., Rawitz, D.: Sparse graphic degree sequences have planar realizations. In: 49th MFCS. LIPIcs, vol. 306, pp. 18:1\u201318:17 (2024)"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103588","volume":"148","author":"A Bar-Noy","year":"2025","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Ran, Y., Rawitz, D.: Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148, 103588 (2025)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR8","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On realizing a single degree sequence by a bipartite graph. In: 18th SWAT. LIPIcs, vol. 227, pp. 1:1\u20131:17 (2022)"},{"key":"17_CR9","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On the role of the high-low partition in realizing a degree sequence by a bipartite graph. In: 47th MFCS. LIPIcs, vol. 241, pp. 14:1\u201314:15 (2022)"},{"issue":"7","key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113460","volume":"346","author":"A Bar-Noy","year":"2023","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: Forcibly bipartite and acyclic (uni-)graphic sequences. Discr. Math. 346(7), 113460 (2023)","journal-title":"Discr. Math."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1111\/j.1749-6632.1979.tb32774.x","volume":"319","author":"LW Beineke","year":"1979","unstructured":"Beineke, L.W., Schmeichel, E.F.: Degrees and cycles in graphs. Ann. N. Y. Acad. Sci. 319, 64\u201370 (1979)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"17_CR12","unstructured":"B\u00edy\u00edkoglu, T.: Degree sequences of halin graphs, and forcibly cograph-graphic sequences. Ars Comb. 75 (2005)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/net.3230080202","volume":"8","author":"FT Boesch","year":"1978","unstructured":"Boesch, F.T., Harary, F.: Unicyclic realizability of a degree list. Networks 8, 93\u201396 (1978)","journal-title":"Networks"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/jgt.20302","volume":"58","author":"P Bose","year":"2008","unstructured":"Bose, P., et al.: A characterization of the degree sequences of 2-trees. J. Graph Theory 58(3), 191\u2013209 (2008)","journal-title":"J. Graph Theory"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Choudum, S.A.: Characterization of forcibly outerplanar graphic sequences. In: Combinatorics and Graph Theory, pp. 203\u2013211 (1981)","DOI":"10.1007\/BFb0092264"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S0004972700002872","volume":"33","author":"SA Choudum","year":"1991","unstructured":"Choudum, S.A.: A simple proof of the Erd\u00f6s-Gallai theorem on graph sequences. Bull. Austral. Math. Soc. 33(1), 67\u201370 (1991)","journal-title":"Bull. Austral. Math. Soc."},{"issue":"1\u20133","key":"17_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.disc.2005.09.005","volume":"304","author":"G Dahl","year":"2005","unstructured":"Dahl, G., Flatberg, T.: A remark concerning graphical sequences. Discr. Math. 304(1\u20133), 62\u201364 (2005)","journal-title":"Discr. Math."},{"key":"17_CR18","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with prescribed degrees of vertices [Hungarian]. Mat. Lapok (N.S.) 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok (N.S.)"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/jgt.3190040405","volume":"4","author":"S Fanelli","year":"1980","unstructured":"Fanelli, S.: On a conjecture on maximal planar sequences. J. Graph Theory 4(4), 371\u2013375 (1980)","journal-title":"J. Graph Theory"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0012-365X(81)90178-3","volume":"36","author":"S Fanelli","year":"1981","unstructured":"Fanelli, S.: An unresolved conjecture on nonmaximal planar graphical sequences. Discr. Math. 36(1), 109\u2013112 (1981)","journal-title":"Discr. Math."},{"key":"17_CR21","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."},{"key":"17_CR22","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 Math. J. 57, 49\u201352 (2007)","journal-title":"Czechoslovak Math. J."},{"issue":"3","key":"17_CR23","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. SIAM J. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"17_CR24","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]. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"issue":"372","key":"17_CR25","doi-asserted-by":"publisher","first-page":"140","DOI":"10.2307\/3611937","volume":"50","author":"A Hawkins","year":"1966","unstructured":"Hawkins, A., Hill, A., Reeve, J., Tyrrell, J.: On certain polyhedra. Math. Gaz. 50(372), 140\u2013144 (1966)","journal-title":"Math. Gaz."},{"key":"17_CR26","first-page":"229","volume":"82","author":"KF Jao","year":"2012","unstructured":"Jao, K.F., West, D.B.: Vertex degrees in outerplanar graphs. J. Comb. Math. Comb. Comput. 82, 229\u2013239 (2012)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11809678_24","volume-title":"Computing and Combinatorics","author":"Z Lotker","year":"2006","unstructured":"Lotker, Z., Majumdar, D., Narayanaswamy, N.S., Weber, I.: Sequences characterizing k-trees. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 216\u2013225. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11809678_24"},{"issue":"4","key":"17_CR28","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TCS.1986.1085935","volume":"33","author":"T Nishi","year":"1986","unstructured":"Nishi, T., Chua, L.O.: Topological proof of the Nielsen-Willson theorem. IEEE Trans. Circuits Syst. 33(4), 398\u2013405 (1986)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1089\/cmb.2010.0252","volume":"18","author":"B Paten","year":"2011","unstructured":"Paten, B., et al.: Cactus graphs for genome comparisons. J. Comput. Biol. 18(3), 469\u2013481 (2011)","journal-title":"J. Comput. Biol."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Ramachandra\u00a0Rao, A.: Degree sequences of cacti. In: Combinatorics and Graph Theory. LNM, pp. 410\u2013416 (1981)","DOI":"10.1007\/BFb0092287"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Rao, S.B.: A survey of the theory of potentially $$p$$-graphic and forcibly $$p$$-graphic degree sequences. In: Combinatorics and Graph Theory. LNM, vol. 885, pp. 417\u2013440 (1981)","DOI":"10.1007\/BFb0092288"},{"key":"17_CR32","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. 9, 371\u2013377 (1957)","journal-title":"Canad. J. Math."},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0132048","volume":"32","author":"EF Schmeichel","year":"1977","unstructured":"Schmeichel, E.F., Hakimi, S.L.: On planar graphical degree sequences. SIAM J. Appl. Math. 32, 598\u2013609 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","volume":"26","author":"MM Sys\u0142o","year":"1979","unstructured":"Sys\u0142o, M.M.: Characterizations of outerplanar graphs. Discr. Math. 26(1), 47\u201353 (1979)","journal-title":"Discr. Math."},{"issue":"18","key":"17_CR35","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. Discr. Appl. Math. 156(18), 3513\u20133517 (2008)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"17_CR36","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\u00f6s-Gallai characterization of graphic lists. Discr. Math. 310(4), 843\u2013844 (2010)","journal-title":"Discr. Math."},{"issue":"1\u20133","key":"17_CR37","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0012-365X(02)00886-5","volume":"265","author":"A Tripathi","year":"2003","unstructured":"Tripathi, A., Vijay, S.: A note on a theorem of Erd\u00f6s & Gallai. Discr. Math. 265(1\u20133), 417\u2013420 (2003)","journal-title":"Discr. Math."},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-030-67731-2_32","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"D Wagner","year":"2021","unstructured":"Wagner, D., Wolf, M.: The complexity of flow expansion and electrical flow expansion. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 431\u2013441. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_32"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Wang, D., Kleitman, D.: On the existence of $$n$$-connected graphs with prescribed degrees ($$n >2$$). Networks 3, 225\u2013239 (1973)","DOI":"10.1002\/net.3230030303"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:28Z","timestamp":1747468048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_17","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":"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"}}]}}