{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:49:39Z","timestamp":1649112579150},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0195-6698(95)90042-x","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T00:27:27Z","timestamp":1091665647000},"page":"617-621","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing halved cubes in a constant time per edge"],"prefix":"10.1016","volume":"16","author":[{"given":"Wilfried","family":"Imrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u1e91ar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksander","family":"Vesel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90042-X_BIB1","article-title":"Metric subspaces of L1","volume":"3","author":"Assouad","year":"1982","journal-title":"Publ. Math. Orsay"},{"key":"10.1016\/0195-6698(95)90042-X_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(94)90154-6","article-title":"Faster isometric embeddings in products of complete graphs","volume":"52","author":"Aurenhammer","year":"1994","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/0195-6698(95)90042-X_BIB3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/0020-0190(80)90025-3","article-title":"On the complexity of testing a graph for n-cube","volume":"11","author":"Bhat","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0195-6698(95)90042-X_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1093\/qmath\/44.4.399","article-title":"Hypermetric graphs","volume":"44","author":"Deza","year":"1993","journal-title":"Q. J. Math. Oxford Ser. (2)"},{"key":"10.1016\/0195-6698(95)90042-X_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1022441506632","article-title":"l1-rigid graphs","volume":"3","author":"Deza","year":"1994","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/0195-6698(95)90042-X_BIB6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/jgt.3190160508","article-title":"Product graph representations","volume":"16","author":"Feder","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/0195-6698(95)90042-X_BIB7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1985-0776391-5","article-title":"On isometric embeddings of graphs","volume":"288","author":"Graham","year":"1985","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0195-6698(95)90042-X_BIB8","unstructured":"J. Hagauer, personal communication."},{"key":"10.1016\/0195-6698(95)90042-X_BIB9","first-page":"410","volume":"31","author":"Hagauer","year":"1993"},{"key":"10.1016\/0195-6698(95)90042-X_BIB10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0195-6698(86)80037-3","article-title":"Distance-regular graphs and halved graphs","volume":"7","author":"Hemmeter","year":"1986","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90042-X_BIB11","first-page":"45","article-title":"A simple O(mn) algorithm for recognizing Hamming graphs","volume":"9","author":"Imrich","year":"1993","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/0195-6698(95)90042-X_BIB12","first-page":"75","article-title":"Convex-expansion algorithms for recognition and isometric embedding of median graphs","volume":"34","author":"Jha","year":"1992","journal-title":"Ars Combin."},{"key":"10.1016\/0195-6698(95)90042-X_BIB13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/eujc.1993.1016","article-title":"On scale embeddings of graphs into hypereubes","volume":"14","author":"Shpectorov","year":"1993","journal-title":"Europ. J. Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019566989590042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019566989590042X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:34:21Z","timestamp":1549326861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019566989590042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["019566989590042X"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90042-x","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}