{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:00:40Z","timestamp":1742922040916,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_8","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Realizations for\u00a0Outerplanaric Degree Sequences"],"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":[[2024,6,22]]},"reference":[{"key":"8_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. Disc. Math. 342, 433\u2013440 (2019)","journal-title":"Disc. Math."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Th. B 27, 320\u2013331 (1979)","journal-title":"J. Comb. Th. B"},{"key":"8_CR3","first-page":"191","volume":"58","author":"P Bose","year":"2008","unstructured":"Bose, P., Dujmovi\u0107, V., Krizanc, D., Langerman, S., Morin, P., Wood, D.R., Wuhrer, S.: A characterization of the degree sequences of 2-trees. JGT 58, 191\u2013209 (2008)","journal-title":"JGT"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.dam.2012.08.023","volume":"161","author":"CN Campos","year":"2013","unstructured":"Campos, C.N., Wakabayashi, Y.: On dominating sets of maximal outerplanar graphs. Disc. Appl. Math. 161(3), 330\u2013335 (2013)","journal-title":"Disc. Appl. Math."},{"key":"8_CR5","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"},{"key":"8_CR6","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices [Hungarian]. Mat. Lapok (N.S.) 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok (N.S.)"},{"key":"8_CR7","first-page":"371","volume":"4","author":"S Fanelli","year":"1980","unstructured":"Fanelli, S.: On a conjecture on maximal planar sequences. JGT 4, 371\u2013375 (1980)","journal-title":"JGT"},{"issue":"1","key":"8_CR8","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. Disc. Math. 36(1), 109\u2013112 (1981)","journal-title":"Disc. Math."},{"key":"8_CR9","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":"8_CR10","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":"8_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]. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"issue":"372","key":"8_CR12","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":"8_CR13","first-page":"237","volume":"140","author":"Z Li","year":"2018","unstructured":"Li, Z., Zuo, Y.: On the degree sequences of maximal outerplanar graphs. Ars Comb. 140, 237\u2013250 (2018)","journal-title":"Ars Comb."},{"key":"8_CR14","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"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00995176","volume":"8","author":"A Proskurowski","year":"1979","unstructured":"Proskurowski, A.: Minimum dominating cycles in 2-trees. Int. J. Comput. Inf. Sci. 8, 405\u2013417 (1979)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-981-19-9582-8_14","volume-title":"ICS 2022","author":"MT Rafid","year":"2022","unstructured":"Rafid, M.T., Ibrat, R., Rahman, M.S.: Generating scale-free outerplanar networks. In: Hsieh, S.Y., Hung, L.J., Klasing, R., Lee, C.W., Peng, S.L. (eds.) ICS 2022, vol. 1723, pp. 156\u2013166. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-981-19-9582-8_14"},{"key":"8_CR17","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, pp. 417\u2013440 (1981)","DOI":"10.1007\/BFb0092288"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics","author":"S Rengarajan","year":"1995","unstructured":"Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2-trees. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 203\u2013212. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030834"},{"key":"8_CR19","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."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","volume":"26","author":"MM Syslo","year":"1979","unstructured":"Syslo, M.M.: Characterizations of outerplanar graphs. Disc. Math. 26, 47\u201353 (1979)","journal-title":"Disc. Math."},{"key":"8_CR21","volume-title":"Introduction to Graph Theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle river (2001)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: 18th ACM Symposium on Theory of Computing (STOC), pp. 104\u2013108 (1986)","DOI":"10.1145\/12130.12141"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:06:58Z","timestamp":1718975218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}