{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:25:50Z","timestamp":1778678750095,"version":"3.51.4"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,19]],"date-time":"2012-02-19T00:00:00Z","timestamp":1329609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11786-012-0109-6","type":"journal-article","created":{"date-parts":[[2012,2,18]],"date-time":"2012-02-18T07:14:45Z","timestamp":1329549285000},"page":"1-32","source":"Crossref","is-referenced-by-count":21,"title":["A Survey on Hypergraph Products"],"prefix":"10.1007","volume":"6","author":[{"given":"Marc","family":"Hellmuth","sequence":"first","affiliation":[]},{"given":"Lydia","family":"Ostermeier","sequence":"additional","affiliation":[]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,19]]},"reference":[{"issue":"4","key":"109_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1017\/S0963548300001334","volume":"3","author":"R. Ahlswede","year":"1994","unstructured":"Ahlswede R., Cai N.: On partitioning and packing products with rectangles. Combin. Probab. Comput. 3(4), 429\u2013434 (1994)","journal-title":"Combin. Probab. Comput."},{"key":"109_CR2","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Cai, N.: On extremal set partitions in Cartesian product spaces. In: Bollob\u00e1s, B., et\u00a0al. (eds.) Combinatorics, Geometry and Probability. A tribute to Paul Erd\u0151s. Proceedings of the conference dedicated to Paul Erd\u0151s on the occasion of his 80th birthday, pp. 23\u201332, Cambridge, UK, 26 March 1993. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511662034.006"},{"issue":"2","key":"109_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TVCG.2007.46","volume":"13","author":"D. Archambault","year":"2007","unstructured":"Archambault D., Munzner T., Auber D.: TopoLayout: multilevel graph layout by topological features. IEEE Trans. Vis. Comput. Graphics 13(2), 305\u2013317 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"109_CR4","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Franciosa, P.G., Frigioni, D.: Directed hypergraphs: problems, algorithmic results, and a novel decremental approach. In: Restivo, A., Rocca, S.R.D., Roversi, L. (eds.) ICTCS. Lecture Notes in Computer Science, vol. 2202, pp. 312\u2013327. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45446-2_20"},{"issue":"1","key":"109_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","volume":"51","author":"H.-J. Bandelt","year":"1991","unstructured":"Bandelt H.-J., Prisner E.: Clique graphs and helly graphs. J. Combin. Theory Ser. B 51(1), 34\u201345 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"109_CR6","volume-title":"Hypergraphs: Combinatorics of Finite Sets, vol. 45","author":"C. Berge","year":"1989","unstructured":"Berge C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. North-Holland, Amsterdam (1989)"},{"key":"109_CR7","doi-asserted-by":"crossref","unstructured":"Berge, C., Simonovitis, M.: The coloring numbers of the direct product of two hypergraphs. In: Hypergraph Seminar. Lecture Notes in Mathematics, vol. 411, pp. 21\u201333. Springer, Berlin (1974)","DOI":"10.1007\/BFb0066176"},{"key":"109_CR8","doi-asserted-by":"crossref","unstructured":"Blasiak, A., Kleinberg, R., Lubetzky, E.: Lexicographic products and the power of non-linear network coding. CoRR. abs\/1108.2489 (2011)","DOI":"10.1109\/FOCS.2011.39"},{"key":"109_CR9","first-page":"23","volume":"78","author":"A. Bretto","year":"2006","unstructured":"Bretto A.: Hypergraphs and the Helly property. Ars Combin. 78, 23\u201332 (2006)","journal-title":"Ars Combin."},{"key":"109_CR10","doi-asserted-by":"crossref","unstructured":"Bretto, A., Silvestre, Y.: Factorization of Cartesian products of hypergraphs. In: Thai, M.T., et\u00a0al. (eds.) Computing and Combinatorics. Proceedings of 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19\u201321, 2010. Lecture Notes in Computer Science, vol. 6196, pp. 173\u2013181 Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14031-0_20"},{"key":"109_CR11","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). EPTCS, vol. 4, pp. 22\u201328 (2009)","DOI":"10.4204\/EPTCS.4.3"},{"key":"109_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1162\/106454600568294","volume":"6","author":"J. Cupal","year":"2000","unstructured":"Cupal J., Kopp S., Stadler P.F.: RNA shape space topology. Artif. Life 6, 3\u201323 (2000)","journal-title":"Artif. Life"},{"key":"109_CR13","unstructured":"Doerr, B., Gnewuch, M., Hebbinghaus, N.: Discrepancy of products of hypergraphs. In: Felsner, S. (ed.) 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb \u201905). Extended abstracts from the conference, Technische Universit\u00e4t Berlin, Berlin, Germany, September 5\u20139, 2005. Paris: Maison de l\u2019Informatique et des Math\u00e9matiques Discr\u00e8tes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 323-328 (2005)"},{"key":"109_CR14","first-page":"323","volume":"AE","author":"B. Doerr","year":"2005","unstructured":"Doerr B., Gnewuch M., Hebbinghaus N.: Discrepancy of symmetric products of hypergraphs. Discr. Math. Theor. Comput. Sci. AE, 323\u2013338 (2005)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"key":"109_CR15","first-page":"1","volume":"11s","author":"B. Doerr","year":"2004","unstructured":"Doerr B., Srivastav A., Wehr P.: Discrepancy of Cartesian products of arithmetic progressions. Electron. J. Combin. 11s, 1\u201316 (2004)","journal-title":"Electron. J. Combin."},{"key":"109_CR16","first-page":"293","volume":"6","author":"W. D\u00f6rfler","year":"1978","unstructured":"D\u00f6rfler W.: Double covers of hypergraphs and their properties. Ars Combin. 6, 293\u2013313 (1978)","journal-title":"Ars Combin."},{"issue":"1","key":"109_CR17","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. Ann. NY Acad. Sci. 319(1), 169\u2013176 (1979)","journal-title":"Ann. NY Acad. Sci."},{"key":"109_CR18","first-page":"67","volume":"14","author":"W. D\u00f6rfler","year":"1982","unstructured":"D\u00f6rfler W.: On the direct product of hypergraphs. Ars Combin. 14, 67\u201378 (1982)","journal-title":"Ars Combin."},{"key":"109_CR19","first-page":"297","volume":"4","author":"W. D\u00f6rfler","year":"1970","unstructured":"D\u00f6rfler W., Imrich W.: \u00dcber die X-Summe von Mengensystemen. Combinat. Theory Appl., Colloquia Math. Soc. Janos Bolyai 4, 297\u2013309 (1970)","journal-title":"Combinat. Theory Appl., Colloquia Math. Soc. Janos Bolyai"},{"key":"109_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01224952","volume":"34","author":"W. D\u00f6rfler","year":"1980","unstructured":"D\u00f6rfler W., Waller D.A.: A category-theoretical approach to hypergraphs. Arch. Math. 34, 185\u2013192 (1980)","journal-title":"Arch. Math."},{"key":"109_CR21","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1126\/science.280.5368.1451","volume":"280","author":"W. Fontana","year":"1998","unstructured":"Fontana W., Schuster P.: Continuity in evolution: on the nature of transitions. Science 280, 1451\u20131455 (1998)","journal-title":"Science"},{"key":"109_CR22","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1006\/jtbi.1998.0771","volume":"194","author":"W. Fontana","year":"1998","unstructured":"Fontana W., Schuster P.: Shaping space: the possible and the attainable in RNA genotype-phenotype mapping. J. Theor. Biol. 194, 491\u2013515 (1998)","journal-title":"J. Theor. Biol."},{"issue":"2","key":"109_CR23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\u00fcredi","year":"1988","unstructured":"F\u00fcredi Z.: Matchings and covers in hypergraphs. Graphs Comb. 4(2), 115\u2013206 (1988)","journal-title":"Graphs Comb."},{"key":"109_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02735318","volume":"21","author":"G. Gallo","year":"1998","unstructured":"Gallo G., Scutell\u00e0 M.: Directed hypergraphs as a modelling paradigm. Decis. Econ. Finance 21, 97\u2013123 (1998)","journal-title":"Decis. Econ. Finance"},{"key":"109_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF01819779","volume":"6","author":"G. Gaszt","year":"1971","unstructured":"Gaszt G., Imrich W.: On the lexicographic and costrong product of set systems. Aequat. Math. 6, 319\u2013320 (1971)","journal-title":"Aequat. Math."},{"key":"109_CR26","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01818693","volume":"7","author":"G. Gaszt","year":"1971","unstructured":"Gaszt G., Imrich W.: \u00dcber das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems). Aequat. Math. 7, 82\u201393 (1971)","journal-title":"Aequat. Math."},{"key":"109_CR27","unstructured":"Gringmann, L.: Hypergraph Products. Diploma thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Leipzig (2010)"},{"key":"109_CR28","unstructured":"Hahn, G.: Directed hypergraphs: the group of their composition. Ph.D. thesis, McMaster University (1980)"},{"key":"109_CR29","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0095-8956(81)90044-7","volume":"30","author":"G. Hahn","year":"1981","unstructured":"Hahn G.: The automorphism group of a product of hypergraphs. J. Combin. Theory Ser. B 30, 276\u2013281 (1981)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"8","key":"109_CR30","doi-asserted-by":"crossref","first-page":"2538","DOI":"10.1016\/j.disc.2008.06.004","volume":"309","author":"R. Hammack","year":"2009","unstructured":"Hammack R.: On direct product cancellation of graphs. Discrete Math. 309(8), 2538\u20132543 (2009)","journal-title":"Discrete Math."},{"key":"109_CR31","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs. Discrete Mathematics and its Applications","author":"R. Hammack","year":"2011","unstructured":"Hammack R., Imrich W., Klav\u017ear S.: Handbook of Product Graphs. Discrete Mathematics and its Applications, 2nd edn. CRC Press, Boca Raton (2011)","edition":"2"},{"issue":"6","key":"109_CR32","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1109\/TVCG.2010.217","volume":"16","author":"C. Heine","year":"2010","unstructured":"Heine C., Jaenicke S., Hellmuth M., Stadler P.F., Scheuermann G.: Visualization of graph products. IEEE Trans. Vis. Comput. Graphics 16(6), 1082\u20131089 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"12","key":"109_CR33","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.disc.2011.02.016","volume":"311","author":"M. Hellmuth","year":"2011","unstructured":"Hellmuth M.: A local prime factor decomposition algorithm. Discrete Math. 311(12), 944\u2013965 (2011)","journal-title":"Discrete Math."},{"key":"109_CR34","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Ostermeier, L., Stadler, P.F.: A survey on hypergraph products. Math. Comput. Sci. (2012). doi: 10.1007\/s11786-012-0109-6","DOI":"10.1007\/s11786-012-0109-6"},{"key":"109_CR35","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":"109_CR36","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. J. Combin. Theory 11(1), 1\u201316 (1971)","journal-title":"J. Combin. Theory"},{"issue":"4","key":"109_CR37","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. Monatsh. f\u00fcr Math. 80(4), 277\u2013281 (1975)","journal-title":"Monatsh. f\u00fcr Math."},{"key":"109_CR38","volume-title":"Product Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"W. Imrich","year":"2000","unstructured":"Imrich W., Klav\u017ear S.: Product Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"109_CR39","doi-asserted-by":"crossref","DOI":"10.1201\/b10613","volume-title":"Topics in Graph Theory: Graphs and Their Cartesian Product","author":"W. Imrich","year":"2008","unstructured":"Imrich W., Klav\u017ear S., Douglas F.R.: Topics in Graph Theory: Graphs and Their Cartesian Product. AK Peters Ltd., Wellesley (2008)"},{"issue":"3-5","key":"109_CR40","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.disc.2005.09.038","volume":"307","author":"W. Imrich","year":"2007","unstructured":"Imrich W., Peterin I.: Recognizing Cartesian products in linear time. Discrete Math. 307(3-5), 472\u2013483 (2007)","journal-title":"Discrete Math."},{"key":"109_CR41","doi-asserted-by":"crossref","first-page":"135","DOI":"10.7151\/dmgt.1307","volume":"26","author":"W. Imrich","year":"2006","unstructured":"Imrich W., Stadler P.F.: A prime factor theorem for a generalized direct product. Discussiones Math. Graph Th. 26, 135\u2013140 (2006)","journal-title":"Discussiones Math. Graph Th."},{"key":"109_CR42","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Products of graphs and their applications. In: Graph Theory. Lecture Notes in Mathematics, vol. 1018, pp. 151\u2013160. Springer, Berlin-Heidelberg (1983)","DOI":"10.1007\/BFb0071625"},{"issue":"11\u201312","key":"109_CR43","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/j.compstruc.2007.11.005","volume":"86","author":"A. Kaveh","year":"2008","unstructured":"Kaveh A., Koohestani K.: Graph products for configuration processing of space structures. Comput. Struct. 86(11\u201312), 1219\u20131231 (2008)","journal-title":"Comput. Struct."},{"issue":"11","key":"109_CR44","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1002\/nme.1126","volume":"61","author":"A. Kaveh","year":"2004","unstructured":"Kaveh A., Rahami H.: An efficient method for decomposition of regular structures using graph products. Int. J. Numer. Meth. Eng. 61(11), 1797\u20131808 (2004)","journal-title":"Int. J. Numer. Meth. Eng."},{"issue":"5","key":"109_CR45","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1214\/aoms\/1177693169","volume":"42","author":"R.J. McEliece","year":"1971","unstructured":"McEliece R.J., Posner E.C.: Hide and seek, data storage, and entropy. Ann. Math. Stat. 42(5), 1706\u20131716 (1971)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"109_CR46","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2006.03.005","volume":"97","author":"D. Mubayi","year":"2007","unstructured":"Mubayi D., R\u00f6dl V.: On the chromatic number and independence number of hypergraph products. J. Combin. Theory Ser. B 97(1), 151\u2013155 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"109_CR47","doi-asserted-by":"crossref","unstructured":"Ostermeier, L., Hellmuth, M., Stadler, P.F.: The Cartesian product of hypergraphs. J. Graph Theory (2011)","DOI":"10.1002\/jgt.20609"},{"issue":"2","key":"109_CR48","doi-asserted-by":"crossref","first-page":"231","DOI":"10.26493\/1855-3974.104.5b7","volume":"2","author":"P.-J. Ostermeier","year":"2009","unstructured":"Ostermeier P.-J., Hellmuth M., Klemm K., Leydold J., Stadler P.F.: A note on quasi-robust cycle bases. Ars Math. Contemp. 2(2), 231\u2013240 (2009)","journal-title":"Ars Math. Contemp."},{"issue":"1","key":"109_CR49","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/0405011","volume":"5","author":"R. Pemantle","year":"1992","unstructured":"Pemantle R., Propp J., Ullman D.: On tensor powers of integer programs. SIAM J. Discrete Math. 5(1), 127\u2013143 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"109_CR50","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","volume":"72","author":"G. Sabidussi","year":"1960","unstructured":"Sabidussi G.: Graph multiplication. Math. Z. 72(1), 446\u2013457 (1960)","journal-title":"Math. Z."},{"issue":"3","key":"109_CR51","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":"109_CR52","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."},{"issue":"7","key":"109_CR53","first-page":"385","volume":"27","author":"M. Sonntag","year":"1991","unstructured":"Sonntag M.: Corrigendum to: \u201cHamiltonicity of the normal product of hypergraphs\u201d. J. Inf. Process. Cybern. 27(7), 385\u2013386 (1991)","journal-title":"J. Inf. Process. Cybern."},{"issue":"5\u20136","key":"109_CR54","first-page":"289","volume":"27","author":"M. Sonntag","year":"1991","unstructured":"Sonntag M.: Hamiltonicity and traceability of the lexicographic product of hypergraphs. J. Inf. Process. Cybern. 27(5\u20136), 289\u2013301 (1991)","journal-title":"J. Inf. Process. Cybern."},{"key":"109_CR55","unstructured":"Sonntag, M.: Hamiltonsche Eigenschaften von Produkten von Hypergraphen. Habilitation, Fakult\u00e4t f\u00fcr Mathematik und Naturwissenschaften, Bergakademie Freiberg (1991)"},{"key":"109_CR56","first-page":"329","volume":"51","author":"M. Sonntag","year":"1992","unstructured":"Sonntag M.: Hamiltonicity of products of hypergraphs. Combinatorics, graphs and complexity. Proc. 4th Czech. Symp., Prachatice\/Czech. 1990. Ann. Discrete Math. 51, 329\u2013332 (1992)","journal-title":"Proc. 4th Czech. Symp., Prachatice\/Czech. 1990. Ann. Discrete Math."},{"issue":"3","key":"109_CR57","first-page":"193","volume":"29","author":"M. Sonntag","year":"1993","unstructured":"Sonntag M.: Hamiltonicity of the disjunction of two hypergraphs. J. Inf. Process. Cybern. 29(3), 193\u2013205 (1993)","journal-title":"J. Inf. Process. Cybern."},{"key":"109_CR58","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1006\/jtbi.2001.2423","volume":"213","author":"B.M.R. Stadler","year":"2001","unstructured":"Stadler B.M.R., Stadler P.F., Wagner G.P., Fontana W.: The topology of the possible: formal spaces underlying patterns of evolutionary change. J. Theor. Biol. 213, 241\u2013274 (2001)","journal-title":"J. Theor. Biol."},{"key":"109_CR59","doi-asserted-by":"crossref","unstructured":"Sterboul, F.: On the chromatic number of the direct product of hypergraphs. In: Proc. 1st Working Sem. Hypergraphs, Columbus 1972. Lect. Notes Math., vol. 411, pp. 165\u2013174 (1974)","DOI":"10.1007\/BFb0066191"},{"key":"109_CR60","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1006\/jtbi.2003.3150","volume":"220","author":"G. Wagner","year":"2003","unstructured":"Wagner G., Stadler P.F.: Quasi-independence, homology and the unity of type: a topological theory of characters. J. Theor. Biol. 220, 505\u2013527 (2003)","journal-title":"J. Theor. Biol."},{"key":"109_CR61","doi-asserted-by":"crossref","unstructured":"Zeigarnik, A.V.: On hypercycles and hypercircuits in hypergraphs. In: Hansen, P., Fowler, P.W., Zheng, M. (eds.) Discrete Mathematical Chemistry. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 51, pp. 377\u2013383. American Mathematical Society, Providence (2000)","DOI":"10.1090\/dimacs\/051\/28"},{"key":"109_CR62","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-012-0109-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-012-0109-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0109-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T17:26:10Z","timestamp":1593710770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-012-0109-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,19]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s11786-012-0109-6","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,19]]}}}