{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:47:24Z","timestamp":1759942044488,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T00:00:00Z","timestamp":1600128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T00:00:00Z","timestamp":1600128000000},"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":[[2021,1]]},"DOI":"10.1007\/s00373-020-02231-3","type":"journal-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T07:02:38Z","timestamp":1600153358000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unit Ball Graphs on Geodesic Spaces"],"prefix":"10.1007","volume":"37","author":[{"given":"Masamichi","family":"Kuroda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5805-910X","authenticated-orcid":false,"given":"Shuhei","family":"Tsujie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,15]]},"reference":[{"key":"2231_CR1","doi-asserted-by":"crossref","unstructured":"Alperin, R.,\u00a0Bass, H.: Length functions of group actions on $${\\Lambda }$$-trees. Combinatorial group theory and topology, Annals of mathematics studies, no. 111, Princeton Univ. Pr, Princeton, NJ, pp.\u00a0265\u2013378 (1987)","DOI":"10.1515\/9781400882083-017"},{"issue":"1","key":"2231_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00454-018-9968-1","volume":"60","author":"A Atminas","year":"2018","unstructured":"Atminas, A., Zamaraev, V.: On Forbidden induced subgraphs for unit disk graphs. Discrete Comput. Geometry 60(1), 57\u201397 (2018)","journal-title":"Discrete Comput. Geometry"},{"key":"2231_CR3","doi-asserted-by":"publisher","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph classes: a survey, discrete mathematics and applications. Soc. Ind. Appl. Math. (January 1999). https:\/\/doi.org\/10.1137\/1.9780898719796","DOI":"10.1137\/1.9780898719796"},{"key":"2231_CR4","unstructured":"Breu, H.: Algorithmic aspects of constrained unit disk graphs, Ph.D. thesis, University of British Columbia (1996)"},{"issue":"1","key":"2231_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geometry 9(1), 3\u201324 (1998)","journal-title":"Comput. Geometry"},{"key":"2231_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12494-9","volume-title":"Metric spaces of non-positive curvature, grundlehren der mathematischen Wissenschaften","author":"MR Bridson","year":"1999","unstructured":"Bridson, M.R., Haefliger, A.: Metric spaces of non-positive curvature, grundlehren der mathematischen Wissenschaften, vol. 319. Springer Berlin Heidelberg, Berlin, Heidelberg (1999)"},{"key":"2231_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/4495","volume-title":"Introduction to $${\\Lambda }$$-trees","author":"I Chiswell","year":"2001","unstructured":"Chiswell, I.: Introduction to $${\\Lambda }$$-trees. World Scientific, Singapore, River Edge (2001)"},{"key":"2231_CR8","unstructured":"Damaschke, P.: Hamiltonian-hereditary graphs, Unpublished (1990)"},{"key":"2231_CR9","unstructured":"Duffus, D., Jacobson, M.S., Gould, R.J.: Forbidden subgraphs and the Hamiltonian theme, The theory and applications of graphs (Kalamazoo, Mich. 1980, Wiley, New York, 1981), pp.\u00a0297\u2013316"},{"issue":"2","key":"2231_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2), 173\u2013189 (1983)","journal-title":"Discrete Math."},{"issue":"1","key":"2231_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combinatorial Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"18","key":"2231_CR12","doi-asserted-by":"publisher","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","volume":"309","author":"MC Lin","year":"2009","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and recognition of circular-arc graphs and subclasses: a survey. Discrete Math. 309(18), 5618\u20135635 (2009)","journal-title":"Discrete Math."},{"key":"2231_CR13","unstructured":"Neuen, D.: Graph Isomorphism for Unit Square Graphs. 24th Annual European Symposium on Algorithms (ESA 2016) (Dagstuhl, Germany), \u00a0Sankowski, P., Zaroliagis, C. (eds.), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a057, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, pp.\u00a070:1\u201370:17 (2016)"},{"key":"2231_CR14","unstructured":"Roberts, F.S.: Indifference graphs. Proof Techniques in Graph Theory. Academic Press, New York, London, pp. 139\u2013146 (1969)"},{"issue":"1","key":"2231_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A Tucker","year":"1974","unstructured":"Tucker, A.: Structure theorems for some circular-arc graphs. Discrete Math. 7(1), 167\u2013195 (1974)","journal-title":"Discrete Math."},{"key":"2231_CR16","unstructured":"Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien $$ \\varvec {{R}}^{n} $$, Ph.D. thesis, G\u00f6ttingen University (1967)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02231-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02231-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02231-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T02:53:53Z","timestamp":1631674433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02231-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,15]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2231"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02231-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,9,15]]},"assertion":[{"value":"10 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}