{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:08:22Z","timestamp":1766178502696,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T00:00:00Z","timestamp":1567468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T00:00:00Z","timestamp":1567468800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0297","P1-0297"],"award-info":[{"award-number":["P1-0297","P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["J1-9109","J1-9109"],"award-info":[{"award-number":["J1-9109","J1-9109"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bilateral project Proteus","award":["BI-FR\/18-19-Proteus-011","BI-FR\/18-19-Proteus-011"],"award-info":[{"award-number":["BI-FR\/18-19-Proteus-011","BI-FR\/18-19-Proteus-011"]}]},{"name":"Bilateral project Proteus","award":["BI-FR\/18-19-Proteus-011","BI-FR\/18-19-Proteus-011"],"award-info":[{"award-number":["BI-FR\/18-19-Proteus-011","BI-FR\/18-19-Proteus-011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00373-019-02089-0","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T08:20:41Z","timestamp":1567498841000},"page":"1555-1569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exact Distance Graphs of Product Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Gastineau","sequence":"additional","affiliation":[]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9510-3595","authenticated-orcid":false,"given":"Olivier","family":"Togni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,3]]},"reference":[{"key":"2089_CR1","first-page":"203","volume":"33","author":"SK Simi\u0107","year":"1983","unstructured":"Simi\u0107, S.K.: Graph equations for line graphs and $$n$$th distance graphs. Publ. Inst. Math. 33, 203\u2013216 (1983)","journal-title":"Publ. Inst. Math."},{"key":"2089_CR2","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"Jaroslav Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity. Graphs, Structures, and Algorithms. Springer, Berlin (2012)"},{"key":"2089_CR3","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s00373-015-1569-7","volume":"31","author":"J Ne\u0161et\u0159il","year":"2015","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: On low tree-depth decompositions. Graphs Comb. 31, 1941\u20131963 (2015)","journal-title":"Graphs Comb."},{"key":"2089_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0963548318000378","volume":"28","author":"N Bousquet","year":"2019","unstructured":"Bousquet, N., Esperet, L., Harutyunyan, A., de Joannis de Verclos, R.: Exact distance colouring in trees. R. Comb. Probab. Comput. 28, 177\u2013186 (2019)","journal-title":"R. Comb. Probab. Comput."},{"key":"2089_CR5","unstructured":"Quiroz, D.A.: Chromatic and structural properties of sparse graph classes. Ph.D. thesis, The London School of Economics and Political Science (LSE) (2017)"},{"key":"2089_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jctb.2018.05.007","volume":"134","author":"J van den Heuvel","year":"2019","unstructured":"van den Heuvel, J., Kierstead, H.A., Quiroz, D.A.: Chromatic numbers of exact distance graphs. J. Comb. Theory Ser. B 134, 143\u2013163 (2019)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2089_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.4153\/CMB-2016-071-6","volume":"60","author":"Ali Azimi","year":"2017","unstructured":"Azimi, A., Farrokhi Derakhshandeh Ghouchan, M.: Self $$2$$-distance graphs. Can. Math. Bull. 60, 26\u201342 (2017)","journal-title":"Canadian Mathematical Bulletin"},{"key":"2089_CR8","first-page":"13","volume":"39","author":"T Dvo\u0159\u00e1k","year":"1990","unstructured":"Dvo\u0159\u00e1k, T., Havel, I., Laborde, J.M., Liebl, P.: Generalized hypercubes and graph embedding with dilation. Rostock. Math. Kolloq. 39, 13\u201320 (1990)","journal-title":"Rostock. Math. Kolloq."},{"key":"2089_CR9","first-page":"249","volume-title":"Four Difficult Unsolved Problems in Graph Theory, Recent Advances in Graph Theory","author":"F Harary","year":"1974","unstructured":"Harary, F.: Four Difficult Unsolved Problems in Graph Theory, Recent Advances in Graph Theory, pp. 249\u2013256. Academia, Prague (1974)"},{"key":"2089_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0095-8956(88)90053-6","volume":"45","author":"N Linial","year":"1988","unstructured":"Linial, N., Meshulam, R., Tarsi, M.: Matroidal bijections between graphs. J. Comb. Theory Ser. B 45, 31\u201344 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2089_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0012-365X(92)90319-B","volume":"103","author":"C Payan","year":"1992","unstructured":"Payan, C.: On the chromatic number of cube-like graphs. Discret. Math. 103, 271\u2013277 (1992)","journal-title":"Discret. Math."},{"key":"2089_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1009759916586","volume":"1","author":"P-J Wan","year":"1997","unstructured":"Wan, P.-J.: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Comb. Optim. 1, 179\u2013186 (1997)","journal-title":"J. Comb. Optim."},{"key":"2089_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45506-X_12","volume":"2122","author":"GM Ziegler","year":"2001","unstructured":"Ziegler, G.M.: Coloring Hamming graphs, optimal binary codes, and the 0\/1-Borsuk problem in low dimensions. Lecture Notes Comput. Sci. 2122, 159\u2013171 (2001)","journal-title":"Lecture Notes Comput. Sci."},{"key":"2089_CR14","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"2089_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Raton (2011)","edition":"2"},{"key":"2089_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"P Weichsel","year":"1962","unstructured":"Weichsel, P.: The Kronecker product of graphs. Proc. Am. Math. Soc. 13, 47\u201352 (1962)","journal-title":"Proc. Am. Math. Soc."},{"key":"2089_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.disc.2017.08.022","volume":"341","author":"LA Agong","year":"2018","unstructured":"Agong, L.A., Amarra, C., Caughman, J.S., Herman, A.J., Terada, T.S.: On the girth and diameter of generalized Johnson graphs. Discret. Math. 341, 138\u2013142 (2018)","journal-title":"Discret. Math."},{"key":"2089_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0097-3165(78)90023-7","volume":"25","author":"I B\u00e1r\u00e1ny","year":"1978","unstructured":"B\u00e1r\u00e1ny, I.: A short proof of Kneser\u2019s conjecture. J. Comb. Theory Ser. B 25, 325\u2013326 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2089_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Comb. Theory Ser. B 25, 319\u2013324 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2089_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00493-004-0011-1","volume":"24","author":"J Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek, J.: A combinatorial proof of Kneser\u2019s conjecture. Combinatorica 24, 163\u2013170 (2004)","journal-title":"Combinatorica"},{"key":"2089_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1134\/S0032946016040050","volume":"52","author":"AV Bobu","year":"2016","unstructured":"Bobu, A.V., Kupriyanov, A.E.: On chromatic numbers of close-to-Kneser distance graphs. Probl. Inf. Transm. 52, 373\u2013390 (2016)","journal-title":"Probl. Inf. Transm."},{"key":"2089_CR22","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ejc.2019.03.004","volume":"79","author":"J Balogh","year":"2019","unstructured":"Balogh, J., Cherkashin, D., Kiselev, S.: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. Eur. J. Comb. 79, 228\u2013236 (2019)","journal-title":"Eur. J. Comb."},{"key":"2089_CR23","first-page":"69","volume":"12","author":"A Jarafi","year":"2016","unstructured":"Jarafi, A., Alipour, S.: On the chromatic number of generalized Kneser graphs. Contrib. Discret. Math. 12, 69\u201376 (2016)","journal-title":"Contrib. Discret. Math."},{"key":"2089_CR24","doi-asserted-by":"publisher","first-page":"2937","DOI":"10.1016\/j.dam.2013.07.006","volume":"161","author":"F-W Fu","year":"2013","unstructured":"Fu, F.-W., Ling, S., Xing, C.: New results on two hypercube coloring problems. Discret. Appl. Math. 161, 2937\u20132945 (2013)","journal-title":"Discret. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02089-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02089-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02089-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T23:27:49Z","timestamp":1599002869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02089-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,3]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2089"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02089-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,9,3]]},"assertion":[{"value":"5 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}