{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T06:03:08Z","timestamp":1780293788668,"version":"3.54.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007471","name":"Northern Borders University","doi-asserted-by":"publisher","award":["NBU-XXXX-2025-2225-XX"],"award-info":[{"award-number":["NBU-XXXX-2025-2225-XX"]}],"id":[{"id":"10.13039\/501100007471","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s40314-026-03716-2","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:35:40Z","timestamp":1780292140000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of almost-2-distance-hereditary graphs in terms of their forbidden subgraphs"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5100-6259","authenticated-orcid":false,"given":"S.","family":"Hayat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Sundareswaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Shanmugapriya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Amalorpavamary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Khan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Saidani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Swaminathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"3716_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(00)00401-5","volume":"242","author":"M A\u00efder","year":"2002","unstructured":"A\u00efder M (2002) Almost distance-hereditary graphs. Discrete Math 242:1\u201316","journal-title":"Discrete Math"},{"key":"3716_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"HJ Bandelt","year":"1986","unstructured":"Bandelt HJ, Mulder HM (1986) Distance-hereditary graphs. J Comb Theory B 41:182\u2013208","journal-title":"J Comb Theory B"},{"key":"3716_CR3","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.627","volume":"7","author":"S Cicerone","year":"2021","unstructured":"Cicerone S, Di Stefano G (2021) Getting new algorithmic results by extending distance-hereditary graphs via split composition. PeerJ Comput Sci 7:e627","journal-title":"PeerJ Comput Sci"},{"issue":"3\u20134","key":"3716_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S1570-8667(03)00030-3","volume":"1","author":"S Cicerone","year":"2003","unstructured":"Cicerone S, Di Stefano G (2003) $$(k,+)$$-distance-hereditary graphs. J Discrete Algorithms 1(3\u20134):281\u2013302","journal-title":"J Discrete Algorithms"},{"issue":"1","key":"3716_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0166-218X(02)00422-5","volume":"131","author":"E Dahlhaus","year":"2003","unstructured":"Dahlhaus E, Dankelmann P, Goddard W, Swart HC (2003) MAD trees and distance-hereditary graphs. Discrete Appl Math 131(1):151\u2013167","journal-title":"Discrete Appl Math"},{"issue":"3","key":"3716_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A D\u00e1tri","year":"1988","unstructured":"D\u00e1tri A, Moscarini M (1988) Distance-hereditary graphs, Steiner trees and connected domination. SIAM J Comput 17(3):521\u2013538","journal-title":"SIAM J Comput"},{"key":"3716_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2020.05.004","volume":"833","author":"FF Dragan","year":"2020","unstructured":"Dragan FF, Guarnera HM (2020) Eccentricity function in distance-hereditary graphs. Theor Comput Sci 833:26\u201340","journal-title":"Theor Comput Sci"},{"key":"3716_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.dam.2021.09.012","volume":"305","author":"G Ducoffe","year":"2021","unstructured":"Ducoffe G, Popa A (2021) The $$b$$-matching problem in distance-hereditary graphs and beyond. Discrete Appl Math 305:233\u2013246","journal-title":"Discrete Appl Math"},{"key":"3716_CR9","first-page":"213","volume":"13","author":"AH Esfahanian","year":"1993","unstructured":"Esfahanian AH, Oellermann OR (1993) Distance-hereditary graphs and multidestination message-routing in multicomputers. J Comb Math Comb Comput 13:213\u2013222","journal-title":"J Comb Math Comb Comput"},{"issue":"1","key":"3716_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/02331930701778981","volume":"57","author":"J Feng","year":"2008","unstructured":"Feng J, Guo Y (2008) Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws. Optimization 57(1):135\u2013141","journal-title":"Optimization"},{"key":"3716_CR11","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph Theory. Addison-Wesley Reading, MA"},{"key":"3716_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka E (1977) A characterization of distance-hereditary graphs. Q J Math 28:417\u2013420","journal-title":"Q J Math"},{"issue":"3","key":"3716_CR13","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1587\/transinf.E96.D.426","volume":"96","author":"M Kiyomi","year":"2013","unstructured":"Kiyomi M, Saitoh T, Uehara R (2013) Reconstruction algorithms for permutation graphs and distance-hereditary graphs. IEICE Trans Inf Syst 96(3):426\u2013432","journal-title":"IEICE Trans Inf Syst"},{"key":"3716_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114009","volume":"968","author":"D Komander","year":"2023","unstructured":"Komander D, Rehs C (2023) Twin-distance-hereditary digraphs. Theor Comput Sci 968:114009","journal-title":"Theor Comput Sci"},{"issue":"4","key":"3716_CR15","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.dam.2006.06.018","volume":"156","author":"E Korach","year":"2008","unstructured":"Korach E, Peled UN, Rotics U (2008) Equistable distance-hereditary graphs. Discrete Appl Math 156(4):462\u2013477","journal-title":"Discrete Appl Math"},{"issue":"11","key":"3716_CR16","doi-asserted-by":"publisher","first-page":"3644","DOI":"10.1016\/j.disc.2007.12.102","volume":"309","author":"K Meslem","year":"2009","unstructured":"Meslem K, A\u00efder M (2009) On an extension of distance hereditary graphs. Discrete Math 309(11):3644\u20133652","journal-title":"Discrete Math"},{"issue":"3","key":"3716_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.disc.2009.03.032","volume":"310","author":"L Nebesk\u00fd","year":"2010","unstructured":"Nebesk\u00fd L (2010) Distance-hereditary graphs and signpost systems. Discrete Math 310(3):527\u2013530","journal-title":"Discrete Math"},{"issue":"8","key":"3716_CR18","doi-asserted-by":"publisher","first-page":"2326","DOI":"10.1016\/j.disc.2018.05.003","volume":"341","author":"PD Priya","year":"2018","unstructured":"Priya PD, Monikandan S (2018) Reconstruction of distance hereditary 2-connected graphs. Discrete Math 341(8):2326\u20132331","journal-title":"Discrete Math"},{"issue":"1\u20133","key":"3716_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0012-365X(02)00630-1","volume":"265","author":"HG Yeh","year":"2003","unstructured":"Yeh HG, Chang GJ (2003) Centers and medians of distance-hereditary graphs. Discrete Math 265(1\u20133):297\u2013310","journal-title":"Discrete Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03716-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03716-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03716-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:35:41Z","timestamp":1780292141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03716-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,1]]},"references-count":19,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["3716"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03716-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,1]]},"assertion":[{"value":"11 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that they have no conflict of interest regarding this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"418"}}