{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T15:30:44Z","timestamp":1770132644677,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s00373-008-0795-7","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T19:24:56Z","timestamp":1221247496000},"page":"291-301","source":"Crossref","is-referenced-by-count":8,"title":["Hadwiger Number and the Cartesian Product of Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Krishnam","family":"Raju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"key":"795_CR1","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Hagauer, J., Imrich, W.: Cartesian graph factorization at logarithmic cost per edge. Computational Complexity 2, 331\u2013349 (1992)","DOI":"10.1007\/BF01200428"},{"key":"795_CR2","doi-asserted-by":"crossref","unstructured":"Chandran, L.S., Sivadasan, N.: On the Hardwiger\u2019s conjecture for graph products. Discrete Mathematics 307, 266\u2013273 (2007)","DOI":"10.1016\/j.disc.2006.06.019"},{"key":"795_CR3","unstructured":"Diestel, R.: Graph Theory. Springer Verlag, New York (2000)"},{"key":"795_CR4","doi-asserted-by":"crossref","unstructured":"Diestel, R., Rempel, C.: Dense minors in graphs of large girth. Combinatorica 25, 111\u2013116 (2005)","DOI":"10.1007\/s00493-005-0009-3"},{"key":"795_CR5","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: In abstrakten Graphen vorhandene vollst\u00e4ndige 4\u2013Graphen und ihre Unterteilungen. Math. Nachr. 22, 61\u201385 (1960)","DOI":"10.1002\/mana.19600220107"},{"key":"795_CR6","unstructured":"Hadwiger, H.: \u00dcber eine Klassifikation der Streckenkomplexe, Vierteljscr. Naturforsch. Gessellsch. Z\u00fcrich 88, 132\u2013142 (1943)"},{"key":"795_CR7","unstructured":"Imrich, W., Klav\u017ear, S.: Product Graphs: Structure and Recognition. Wiley, New York (2000)"},{"key":"795_CR8","unstructured":"Ivan\u010do, J.: Some results on the Hadwiger number of graphs. Math. Slovaca 38, 221\u2013226 (1988)"},{"key":"795_CR9","unstructured":"Iwaniec, H., Pintz, J.: Primes in short intervals. Monatsh. Math. 98, 115\u2013143 (1984)"},{"key":"795_CR10","unstructured":"Kostochka, A.V.: The minimum hadwiger number of graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38, 37\u201358 (1982) (In Russian)"},{"key":"795_CR11","doi-asserted-by":"crossref","unstructured":"Kotlov, A.: Minors and strong products. European Journal of Combinatorics 22, 511\u2013512 (2001)","DOI":"10.1006\/eujc.2000.0428"},{"key":"795_CR12","doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Minors in graphs of large girth. Random Structures and Algorithms 22, 213\u2013225 (2003)","DOI":"10.1002\/rsa.10076"},{"key":"795_CR13","doi-asserted-by":"crossref","unstructured":"Mader, W.: Homomorphies\u00e4tze f\u00fcr Graphen. Math. Annalen 178, 154\u2013168 (1968)","DOI":"10.1007\/BF01350657"},{"key":"795_CR14","doi-asserted-by":"crossref","unstructured":"Miller, Z.: Contractions of graphs: A theorem of Ore and an extremal problem. Discrete Mathematics 21, 261\u2013273 (1978)","DOI":"10.1016\/0012-365X(78)90158-9"},{"key":"795_CR15","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Hadwiger\u2019s conjecture for K6-free graphs. Combinatorica 13, 279\u2013361 (1993)","DOI":"10.1007\/BF01202354"},{"key":"795_CR16","doi-asserted-by":"crossref","unstructured":"Ryser, H.J.: Combinatorial mathematics, The Carus Mathematical Monographs. 14 Wiley, New York (1963)","DOI":"10.5948\/UPO9781614440147"},{"key":"795_CR17","unstructured":"Sabidussi, G.: Graphs with given group and given graph theoretic properties. Canad. J. Math. 9, 515\u2013525 (1957)"},{"key":"795_CR18","unstructured":"Thomason, A.G.: An extremal function for contractions of graphs. Math. Proc. Camb. Phil. Soc. 95, 261\u2013265 (1984)"},{"key":"795_CR19","doi-asserted-by":"crossref","unstructured":"Wagner, K.: \u00dcber eine Eigenschaft der Ebenen Komplexe. Math. Annalen 114, 570\u2013590 (1937)","DOI":"10.1007\/BF01594196"},{"key":"795_CR20","doi-asserted-by":"crossref","unstructured":"Wagner, K.: Beweis einer Abschw\u00e4chung der Hadwiger\u2013Vermutung. Math. Annalen 153, 139\u2013141 (1964)","DOI":"10.1007\/BF01361181"},{"key":"795_CR21","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall India, NewDelhi (2003)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0795-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0795-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0795-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T07:32:07Z","timestamp":1588923127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0795-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["795"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0795-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}