{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T02:10:09Z","timestamp":1758593409025,"version":"3.44.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100009500","name":"BUET","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009500","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00236-025-00503-0","type":"journal-article","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T05:54:55Z","timestamp":1755496495000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the 3-tree core of plane graphs"],"prefix":"10.1007","volume":"62","author":[{"given":"Debajyoti","family":"Mondal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,18]]},"reference":[{"key":"503_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Bl\u00e4sius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and voxel representations of graphs. In: Giacomo, E.D., Lubiw, A. (eds.) Proceedings of Graph Drawing and Network Visualization. LNCS, vol. 9411, pp. 472\u2013486. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-27261-0_39"},{"key":"503_CR2","doi-asserted-by":"crossref","unstructured":"Biedl, T.: Height-preserving transformations of planar graph drawings. In: Duncan, C.A., Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing. LNCS, vol. 8871, pp. 380\u2013391. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-45803-7_32"},{"issue":"1","key":"503_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"11","author":"M Chrobak","year":"1998","unstructured":"Chrobak, M., Nakano, S.-I.: Minimum-width grid drawings of plane graphs. Computational Geometry 11(1), 29\u201354 (1998)","journal-title":"Computational Geometry"},{"issue":"1","key":"503_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"8","key":"503_CR5","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Didimo, W., Evans, W.S., Liotta, G., Meijer, H., Montecchiani, F., Wismath, S.K.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345\u20132383 (2018)","journal-title":"Algorithmica"},{"key":"503_CR6","first-page":"147","volume":"2","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research 2, 147\u2013161 (1984)","journal-title":"Advances in Computing Research"},{"key":"503_CR7","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) Proceedings of the 12th International Symposium on Graph Drawing,. LNCS, vol. 3383, pp. 122\u2013132. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-31843-9_14"},{"key":"503_CR8","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, K., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S.H., Wood, D.: On the parametrized compexity of layered graph drawing. In: Proceedings of European Symposium on Algorithms (ESA). LNCS, vol. 2161, pp. 488\u2013499 (2001)","DOI":"10.1007\/3-540-44676-1_41"},{"issue":"4","key":"503_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.7155\/jgaa.00424","volume":"21","author":"S Durocher","year":"2017","unstructured":"Durocher, S., Mondal, D.: Drawing planar graphs with reduced height. Journal of Graph Algorithms and Applications 21(4), 433\u2013453 (2017)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"503_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.dam.2016.01.028","volume":"206","author":"S Felsner","year":"2016","unstructured":"Felsner, S., Knauer, K.B., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206, 48\u201355 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"503_CR11","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs Comb 29(4), 981\u20131005 (2013)","journal-title":"Graphs Comb"},{"issue":"1","key":"503_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundam. Math. 10(1), 96\u2013115 (1927)","journal-title":"Fundam. Math."},{"issue":"2","key":"503_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00222","volume":"15","author":"D Mondal","year":"2011","unstructured":"Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. Journal of Graph Algorithms and Applications 15(2), 177\u2013204 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"503_CR14","doi-asserted-by":"crossref","unstructured":"Mondal, D., Alam, M.J., Rahman, M.S.: Minimum-layer drawings of trees. In: Proceedings of the 5th International Workshop on Algorithms and Computation. LNCS, vol. 6552, pp. 221\u2013232. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-19094-0_23"},{"issue":"1","key":"503_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11786-011-0078-1","volume":"5","author":"RI Nishat","year":"2011","unstructured":"Nishat, R.I., Mondal, D., Rahman, M.S.: Visibility drawings of plane 3-trees with minimum area. Math. Comput. Sci. 5(1), 119\u2013132 (2011)","journal-title":"Math. Comput. Sci."},{"key":"503_CR16","doi-asserted-by":"crossref","unstructured":"Mondal, D., Rahman, M.S.: On the 3-tree core of plane graphs. In: Proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation (TAMC). LNCS. Springer, Heidelberg (2024). In Press","DOI":"10.1007\/978-981-97-2340-9_13"},{"key":"503_CR17","doi-asserted-by":"crossref","unstructured":"Suderman, M.: Proper and planar drawings of graphs on three layers. In: Proceedings of GD. LNCS, vol. 3843, pp. 434\u2013445 (2005)","DOI":"10.1007\/11618058_39"},{"key":"503_CR18","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138\u2013148. ACM, New York, NY, USA (1990)"},{"key":"503_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry 1, 321\u2013341 (1986)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"503_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00454-004-1154-y","volume":"33","author":"H Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete & Computational Geometry 33(2), 321\u2013344 (2005)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"503_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10878-007-9119-8","volume":"17","author":"H Zhang","year":"2009","unstructured":"Zhang, H., He, X.: Optimal st-orientations for plane triangulations. J. Comb. Optim. 17(4), 367\u2013377 (2009)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"503_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ipl.2005.05.024","volume":"96","author":"H Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Visibility representation of plane graphs via canonical ordering tree. Inf. Process. Lett. 96(2), 41\u201348 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00503-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00503-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00503-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T06:26:00Z","timestamp":1758522360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00503-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,18]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00503-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2025,8,18]]},"assertion":[{"value":"27 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"32"}}