{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:35:17Z","timestamp":1770064517756,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T00:00:00Z","timestamp":1656460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T00:00:00Z","timestamp":1656460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00373-022-02512-z","type":"journal-article","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T16:02:53Z","timestamp":1656518573000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Injective Hulls of Various Graph Classes"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9224-316X","authenticated-orcid":false,"given":"Heather M.","family":"Guarnera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Leitert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,29]]},"reference":[{"issue":"2","key":"2512_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"Hans-J\u00fcrgen Bandelt","year":"1986","unstructured":"Bandelt, Hans-J\u00fcrgen., Mulder, Henry Martyn: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"2512_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0012-365X(86)90212-8","volume":"62","author":"Hans-J\u00fcrgen Bandelt","year":"1986","unstructured":"Bandelt, Hans-J\u00fcrgen., Mulder, Henry Martyn: Pseudo-modular graphs. Discrete Math. 62(3), 245\u2013260 (1986)","journal-title":"Discrete Math."},{"issue":"3","key":"2512_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0195-6698(89)80053-8","volume":"10","author":"Hans-J\u00fcrgen Bandelt","year":"1989","unstructured":"Bandelt, Hans-J\u00fcrgen., Pesch, Erwin: Dismantling absolute retracts of reflexive graphs. Eur. J. Comb. 10(3), 211\u2013220 (1989)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"2512_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","volume":"51","author":"Hans-J\u00fcrgen Bandelt","year":"1991","unstructured":"Bandelt, Hans-J\u00fcrgen., Prisner, Erich: Clique graphs and Helly graphs. J. Combinator. Theory Ser. B 51(1), 34\u201345 (1991)","journal-title":"J. Combinator. Theory Ser. B"},{"issue":"1","key":"2512_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(94)00052-K","volume":"145","author":"Hans-J\u00fcrgen Bandelt","year":"1995","unstructured":"Bandelt, Hans-J\u00fcrgen., Henkmann, Anja, Nicolai, Falk: Powers of distance-hereditary graphs. Discret. Math. 145(1), 37\u201360 (1995)","journal-title":"Discret. Math."},{"key":"2512_CR6","unstructured":"Brandst\u00e4dt, A., Le, V.B. and Spinrad, J.: A Survey. Society for Industrial and Applied Mathematics, Graph Classes (1999)"},{"issue":"3","key":"2512_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"Andreas Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, Andreas, Dragan, Feodor F., Chepoi, Victor, Voloshin, Vitaly I.: Dually chordal graphs. SIAM J. Discret. Math. 11(3), 437\u2013455 (1998)","journal-title":"SIAM J. Discret. Math."},{"key":"2512_CR8","first-page":"423","volume-title":"Algorithm Theory\u2013SWAT","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Dragan, F., Xiang, Y., Yan, C.: Generalized powers of graphs and their algorithmic use. In: Arge, L., Freivalds, R. (eds.) Algorithm Theory\u2013SWAT, pp. 423\u2013434. Springer, Berlin (2006)"},{"key":"2512_CR9","unstructured":"Chalopin, J., Chepoi, V., Genevois, A., Hirai, H., Osajda, D.: Helly groups. arXiv:2002.06895, (2020)"},{"key":"2512_CR10","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F., Vax\u00e8s, Y.: Core congestion is inherent in hyperbolic networks. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201917, pp. 2264\u20132279, Barcelona, Spain (2017)","DOI":"10.1137\/1.9781611974782.149"},{"key":"2512_CR11","first-page":"82","volume":"43","author":"Victor Chepoi","year":"1988","unstructured":"Chepoi, Victor: Centers of triangulated graphs. Math. Notes Acad. Sci. USSR 43, 82\u201386 (1988)","journal-title":"Math. Notes Acad. Sci. USSR"},{"issue":"3","key":"2512_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"Derek Corneil","year":"1997","unstructured":"Corneil, Derek, Olariu, Stephan, Stewart, Lorna: Asteroidal triple-free graphs. SIAM J. Discret. Math. 10(3), 399\u2013430 (1997)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2512_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(92)90296-M","volume":"35","author":"Peter Damaschke","year":"1992","unstructured":"Damaschke, Peter: Distances in cocomparability graphs and their powers. Discret. Appl. Math. 35(1), 67\u201372 (1992)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"2512_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"Guillaume Damiand","year":"2001","unstructured":"Damiand, Guillaume, Habib, Michel, Paul, Christophe: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theoret. Comput. Sci. 263(1), 99\u2013111 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2512_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"Alessandro D\u2019Atri","year":"1988","unstructured":"D\u2019Atri, Alessandro, Moscarini, Marina: Distance-hereditary graphs, steiner trees, and connected domination. SIAM J. Comput. 17(3), 521\u2013538 (1988)","journal-title":"SIAM J. Comput."},{"issue":"16","key":"2512_CR16","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307(16), 2008\u20132029 (2007). (EuroComb \u201903 - Graphs and Algorithms)","journal-title":"Discrete Math."},{"key":"2512_CR17","doi-asserted-by":"crossref","unstructured":"Dragan, F.F., Ducoffe, G., Guarnera, H.M.: Fast deterministic algorithms for computing all eccentricities in (hyperbolic) helly graphs. In: Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9\u201311, 2021, Proceedings, pp. 300\u2013314, Berlin, Heidelberg, 2021. Springer-Verlag","DOI":"10.1007\/978-3-030-83508-8_22"},{"key":"2512_CR18","unstructured":"Dragan, F.: Centers of Graphs and the Helly Property (in Russian). PhD thesis, Moldava State University, Chi\u015fin\u0103u (1989)"},{"key":"2512_CR19","unstructured":"Dragan, F.: Conditions for coincidence of local and global minima for eccentricity function on graphs and the Helly property (in Russian). Studies in Applied Mathematics and Information Science, pp. 49\u201356 (1990)"},{"issue":"2","key":"2512_CR20","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.disc.2018.10.017","volume":"342","author":"Feodor Dragan","year":"2019","unstructured":"Dragan, Feodor, Guarnera, Heather: Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. 342(2), 326\u2013338 (2019)","journal-title":"Discret. Math."},{"key":"2512_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2021.03.022","volume":"867","author":"Feodor F Dragan","year":"2021","unstructured":"Dragan, Feodor F., Guarnera, Heather M.: Helly-gap of a graph and vertex eccentricities. Theoret. Comput. Sci. 867, 68\u201384 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2512_CR22","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s00453-013-9765-4","volume":"69","author":"Feodor Dragan","year":"2014","unstructured":"Dragan, Feodor, K\u00f6hler, Ekkehard: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs. Algorithmica 69(4), 884\u2013905 (2014)","journal-title":"Algorithmica"},{"key":"2512_CR23","first-page":"67","volume":"4","author":"Feodor Dragan","year":"1992","unstructured":"Dragan, Feodor, Prisacaru, Chiril, Chepoi, Victor: Location problems in graphs and the Helly property (in Russian) (1987). Appeared Partially Diskretnaja Matematika 4, 67\u201373 (1992)","journal-title":"Appeared Partially Diskretnaja Matematika"},{"key":"2512_CR24","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.dam.2017.07.017","volume":"232","author":"Feodor Dragan","year":"2017","unstructured":"Dragan, Feodor, K\u00f6hler, Ekkehard, Alrasheed, Hend: Eccentricity approximating trees. Discret. Appl. Math. 232, 142\u2013156 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"2512_CR25","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0001-8708(84)90029-X","volume":"53","author":"Andreas WM Dress","year":"1984","unstructured":"Dress, Andreas WM.: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: a note on combinatorial properties of metric spaces. Adv. Math. 53(3), 321\u2013402 (1984)","journal-title":"Adv. Math."},{"key":"2512_CR26","unstructured":"Ducoffe, G.: Distance problems within Helly graphs and $$k$$-Helly graphs. arXiv:2011.00001 (2020)"},{"issue":"3","key":"2512_CR27","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/net.21998","volume":"77","author":"Guillaume Ducoffe","year":"2021","unstructured":"Ducoffe, Guillaume, Dragan, Feodor F.: A story of diameter, radius, and (almost) helly property. Networks 77(3), 435\u2013453 (2021)","journal-title":"Networks"},{"issue":"3","key":"2512_CR28","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(87)90100-2","volume":"66","author":"Martin Farber","year":"1987","unstructured":"Farber, Martin: Bridged graphs and geodesic convexity. Discret. Math. 66(3), 249\u2013257 (1987)","journal-title":"Discret. Math."},{"key":"2512_CR29","unstructured":"Foldes, S., Hammer, P.L.: Split graphs. Congres. Numer., pp 311\u2013315 (1977)"},{"issue":"4","key":"2512_CR30","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. Quart. J. Math. 28(4), 417\u2013420 (1977). (12)","journal-title":"Quart. J. Math."},{"key":"2512_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02566944","volume":"39","author":"JR Isbell","year":"1964","unstructured":"Isbell, J.R.: Six theorems about injective metric spaces. Commentarii mathematici Helvetici 39, 65\u201376 (1964)","journal-title":"Commentarii mathematici Helvetici"},{"issue":"03","key":"2512_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1142\/S1793525313500118","volume":"05","author":"Urs Lang","year":"2013","unstructured":"Lang, Urs: Injective hulls of certain discrete metric spaces and groups. J. Topol. Anal. 05(03), 297\u2013331 (2013)","journal-title":"J. Topol. Anal."},{"issue":"2","key":"2512_CR33","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(83)90159-0","volume":"43","author":"Richard Nowakowski","year":"1983","unstructured":"Nowakowski, Richard, Rival, Ivan: The smallest graph variety containing all paths. Discret. Math. 43(2), 223\u2013234 (1983)","journal-title":"Discret. Math."},{"issue":"6","key":"2512_CR34","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"Robert Paige","year":"1987","unstructured":"Paige, Robert, Tarjan, Robert Endre: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2512_CR35","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0097-3165(85)90061-5","volume":"40","author":"Alain Quilliot","year":"1985","unstructured":"Quilliot, Alain: On the Helly property working as a compactness criterion on graphs. J. Combinator. Theory Ser. A 40(1), 186\u2013193 (1985)","journal-title":"J. Combinator. Theory Ser. A"},{"key":"2512_CR36","unstructured":"Tyshkevich, R.I., Chernyak, A.A.: Canonical partition of a graph defined by the degrees of its vertices (in Russian). Isv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 5, 14\u201326 (1979)"},{"issue":"1","key":"2512_CR37","doi-asserted-by":"publisher","first-page":"P43","DOI":"10.37236\/530","volume":"18","author":"Wu Yaokun","year":"2011","unstructured":"Yaokun, Wu., Zhang, Chengpeng: Hyperbolicity and chordality of a graph. Electron. J. Comb. 18(1), P43 (2011)","journal-title":"Electron. J. Comb."},{"key":"2512_CR38","first-page":"217","volume":"3","author":"SV Yushmanov","year":"1991","unstructured":"Yushmanov, S.V., Chepoi, V.: A general method of investigation of metric graph properties related to the eccentricity (in Russian). Math. Problems Cybernet. (Moscow) 3, 217\u2013232 (1991)","journal-title":"Math. Problems Cybernet. (Moscow)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02512-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T13:15:47Z","timestamp":1660223747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02512-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,29]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2512"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02512-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,29]]},"assertion":[{"value":"24 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"112"}}