{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T08:08:32Z","timestamp":1692778112644},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11786-016-0276-y","type":"journal-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T23:59:03Z","timestamp":1469577543000},"page":"403-408","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Associativity and Non-Associativity of Some Hypergraph Products"],"prefix":"10.1007","volume":"10","author":[{"given":"Richard H.","family":"Hammack","sequence":"first","affiliation":[]},{"given":"Marc","family":"Hellmuth","sequence":"additional","affiliation":[]},{"given":"Lydia","family":"Ostermeier","sequence":"additional","affiliation":[]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,27]]},"reference":[{"key":"276_CR1","volume-title":"Hypergraphs: Combinatorics of finite sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs: Combinatorics of finite sets, vol. 45. North-Holland, Amsterdam (1989)"},{"key":"276_CR2","doi-asserted-by":"crossref","unstructured":"Black, T.: Monotone properties of k-uniform hypergraphs are weakly evasive. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. ITCS \u201915, pp. 383\u2013391, New York, NY, USA (2015). ACM","DOI":"10.1145\/2688073.2688085"},{"key":"276_CR3","doi-asserted-by":"crossref","unstructured":"Bretto, A., Silvestre, Y., Vall\u00e9e. T.: Cartesian product of hypergraphs: properties and algorithms. In: 4th Athens Colloquium on Algorithms and Complexity (ACAC 2009). vol. 4 of EPTCS. pp. 22\u201328 (2009)","DOI":"10.4204\/EPTCS.4.3"},{"issue":"1","key":"276_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1111\/j.1749-6632.1979.tb32788.x","volume":"319","author":"W D\u00f6rfler","year":"1979","unstructured":"D\u00f6rfler, W.: Multiple Covers of Hypergraphs. Annals of the New York Academy of Sciences 319(1), 169\u2013176 (1979)","journal-title":"Annals of the New York Academy of Sciences"},{"key":"276_CR5","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs. Discrete Mathematics and its Applications, 2nd edn. CRC Press (2011)","DOI":"10.1201\/b10959"},{"key":"276_CR6","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Lehner, F.: Fast factorization of cartesian products of (directed) hypergraphs. J. Theor. Comp. Sci. (2015) submitted","DOI":"10.1016\/j.tcs.2014.10.045"},{"key":"276_CR7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2014.02.017","volume":"171","author":"M Hellmuth","year":"2014","unstructured":"Hellmuth, M., Ostermeier, L., Noll, M.: Strong products of hypergraphs: Unique prime factorization theorems and algorithms. Discr. Appl. Math. 171, 60\u201371 (2014)","journal-title":"Discr. Appl. Math."},{"key":"276_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11786-012-0109-6","volume":"6","author":"M Hellmuth","year":"2012","unstructured":"Hellmuth, M., Ostermeier, L., Stadler, P.F.: A survey on hypergraph products. Math. Comp. Sci. 6, 1\u201332 (2012)","journal-title":"Math. Comp. Sci."},{"key":"276_CR9","first-page":"285","volume":"2","author":"W Imrich","year":"1967","unstructured":"Imrich, W.: Kartesisches Produkt von Mengensystemen und Graphen. Studia Sci. Math. Hungar. 2, 285\u2013290 (1967)","journal-title":"Studia Sci. Math. Hungar."},{"issue":"1","key":"276_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(71)90008-6","volume":"11","author":"W Imrich","year":"1971","unstructured":"Imrich, W.: \u00fcber das schwache Kartesische Produkt von Graphen. Journal of Combinatorial Theory 11(1), 1\u201316 (1971)","journal-title":"Journal of Combinatorial Theory"},{"issue":"4","key":"276_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01472575","volume":"80","author":"W Imrich","year":"1975","unstructured":"Imrich, W., Izbicki, H.: Associative products of graphs. Monatshefte f\u00fcr Mathematik 80(4), 277\u2013281 (1975)","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"276_CR12","unstructured":"Kaveh, A., Alinejad, B.: Hypergraph products for structural mechanics. In: Topping, B.H.V. (ed), Proceedings of the Eleventh International Conference on Computational Structures Technology. Stirlingshire, UK (2012). Civil-Comp Press. Paper 266"},{"key":"276_CR13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.advengsoft.2014.09.017","volume":"80","author":"A Kaveh","year":"2015","unstructured":"Kaveh, A., Alinejad, B.: Hypergraph products for structural mechanics. Advances in Engineering Software 80, 72\u201381 (2015). Civil-Comp","journal-title":"Advances in Engineering Software"},{"key":"276_CR14","doi-asserted-by":"crossref","unstructured":"Ostermeier, L., Hellmuth, M., Stadler, P.F.: The Cartesian product of hypergraphs. Journal of Graph Theory (2011)","DOI":"10.1002\/jgt.20609"},{"issue":"3","key":"276_CR15","first-page":"87","volume":"25","author":"M Sonntag","year":"1989","unstructured":"Sonntag, M.: Hamiltonian properties of the Cartesian sum of hypergraphs. J. Inf. Process. Cybern. 25(3), 87\u2013100 (1989)","journal-title":"J. Inf. Process. Cybern."},{"issue":"7","key":"276_CR16","first-page":"415","volume":"26","author":"M Sonntag","year":"1990","unstructured":"Sonntag, M.: Hamiltonicity of the normal product of hypergraphs. J. Inf. Process. Cybern. 26(7), 415\u2013433 (1990)","journal-title":"J. Inf. Process. Cybern."},{"key":"276_CR17","unstructured":"Sonntag, M.: Hamiltonsche Eigenschaften von Produkten von Hypergraphen. Habilitation, Fakult\u00e4t f\u00fcr Mathematik und Naturwissenschaften, Bergakademie Freiberg (1991)"},{"key":"276_CR18","first-page":"25","volume":"34","author":"X Zhu","year":"1992","unstructured":"Zhu, X.: On the chromatic number of the product of hypergraphs. Ars Comb. 34, 25\u201331 (1992)","journal-title":"Ars Comb."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0276-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0276-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0276-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T15:03:02Z","timestamp":1568214182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0276-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,27]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0276-y","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,27]]}}}