dc.contributor.author | Fronček, Dalibor | |
dc.contributor.author | Jerebic, Janja | |
dc.contributor.author | Klavžar, Sandi | |
dc.contributor.author | Kovář, Petr | |
dc.date.accessioned | 2007-04-04T10:47:48Z | |
dc.date.available | 2007-04-04T10:47:48Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | Combinatorics, Probability and Computing. 2007, vol. 16, issue 2, p. 271-275. | en |
dc.identifier.issn | 0963-5483 | |
dc.identifier.issn | 1469-2163 | |
dc.identifier.uri | http://hdl.handle.net/10084/59882 | |
dc.language.iso | en | en |
dc.publisher | Cambridge University Press | en |
dc.relation.ispartofseries | Combinatorics, Probability and Computing | en |
dc.relation.uri | https://doi.org/10.1017/S0963548306007711 | en |
dc.title | Strong isometric dimension, biclique coverings, and sperner's theorem | en |
dc.type | article | en |
dc.identifier.location | Není ve fondu ÚK | en |
dc.description.abstract-en | The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's theorem, the strong isometric dimension of the Hamming graphs K-2 square K-n is determined. | en |
dc.identifier.doi | 10.1017/S0963548306007711 | |
dc.identifier.wos | 000244849900007 | |