{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:40:06Z","timestamp":1750470006137,"version":"3.41.0"},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2007,3]]},"abstract":"<jats:p>The strong isometric dimension of a graph <jats:italic>G<\/jats:italic> is the least number <jats:italic>k<\/jats:italic> such that <jats:italic>G<\/jats:italic> isometrically embeds into the strong product of <jats:italic>k<\/jats:italic> paths. Using Sperner's theorem, the strong isometric dimension of the Hamming graphs <jats:italic>K<\/jats:italic><jats:sub>2<\/jats:sub> \u25a1 <jats:italic>K<jats:sub>n<\/jats:sub><\/jats:italic> is determined.<\/jats:p>","DOI":"10.1017\/s0963548306007711","type":"journal-article","created":{"date-parts":[[2006,8,14]],"date-time":"2006-08-14T09:28:27Z","timestamp":1155547707000},"page":"271-275","source":"Crossref","is-referenced-by-count":7,"title":["Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem"],"prefix":"10.1017","volume":"16","author":[{"given":"DALIBOR","family":"FRON\u010cEK","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JANJA","family":"JEREBIC","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SANDI","family":"KLAV\u017dAR","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PETR","family":"KOV\u00c1\u0158","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2007,3,1]]},"reference":[{"key":"S0963548306007711_manual_ref-3","first-page":"77","article-title":"The embedding dimension of a graph","volume":"9","author":"Dewdney","year":"1980","journal-title":"Ars Combin."},{"key":"S0963548306007711_manual_ref-6","first-page":"65","article-title":"Copnumber of graphs with strong isometric dimension two","volume":"59","author":"Fitzpatrick","year":"2001","journal-title":"Ars Combin."},{"key":"S0963548306007711_manual_ref-1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90109-0"},{"key":"S0963548306007711_manual_ref-11","first-page":"199","article-title":"Three remarks on dimensions of graphs","volume":"28","author":"Ne\u0161et\u0159il","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"S0963548306007711_manual_ref-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.019"},{"key":"S0963548306007711_manual_ref-15","doi-asserted-by":"publisher","DOI":"10.37236\/1672"},{"key":"S0963548306007711_manual_ref-9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02566944"},{"key":"S0963548306007711_manual_ref-4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574719"},{"key":"S0963548306007711_manual_ref-13","first-page":"449","article-title":"Representing graphs by means of strong and weak products","volume":"22","author":"Poljak","year":"1981","journal-title":"Comment. Math. Univ. Carolin."},{"key":"S0963548306007711_manual_ref-14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1938-1501980-0"},{"volume-title":"Product Graphs: Structure and Recognition","year":"2000","author":"Imrich","key":"S0963548306007711_manual_ref-8"},{"key":"S0963548306007711_manual_ref-2","doi-asserted-by":"publisher","DOI":"10.1137\/0602001"},{"key":"S0963548306007711_manual_ref-5","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1104"},{"key":"S0963548306007711_manual_ref-7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00367-8"},{"key":"S0963548306007711_manual_ref-12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90160-7"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548306007711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:05:47Z","timestamp":1750467947000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548306007711\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["S0963548306007711"],"URL":"https:\/\/doi.org\/10.1017\/s0963548306007711","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"type":"print","value":"0963-5483"},{"type":"electronic","value":"1469-2163"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}