{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:59:24Z","timestamp":1775717964422,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871019"],"award-info":[{"award-number":["11871019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["A2025205023"],"award-info":[{"award-number":["A2025205023"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00373-025-03007-3","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T09:13:00Z","timestamp":1772701980000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mixed Covering Arrays on Hypergraphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Jinghui","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xuejiao","family":"Qu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8503-5151","authenticated-orcid":false,"given":"Zihong","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Xiuling","family":"Shan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,5]]},"reference":[{"key":"3007_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/09728600.2022.2081523","volume":"19","author":"Y Akhtar","year":"2022","unstructured":"Akhtar, Y.: A hyperedge coloring and application in combinatorial testing. AKCE Int. J. Graphs Comb. 19, 125\u2013132 (2022)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"3007_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00373-024-02813-5","volume":"40","author":"Y Akhtar","year":"2024","unstructured":"Akhtar, Y., Maity, S.: Covering array on the Cartesian product of hypergraphs. Graghs Combin. 40, 87 (2024)","journal-title":"Graghs Combin."},{"key":"3007_CR3","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s00373-017-1800-9","volume":"33","author":"Y Akhtar","year":"2017","unstructured":"Akhtar, Y., Maity, S.: Covering arrays on product graphs. Graghs Combin. 33, 635\u2013652 (2017a)","journal-title":"Graghs Combin."},{"key":"3007_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.dam.2017.08.023","volume":"232","author":"Y Akhtar","year":"2017","unstructured":"Akhtar, Y., Maity, S.: Mixed covering arrays on $$3$$-uniform hypergraphs. Discrete Appl. Math. 232, 8\u201322 (2017)","journal-title":"Discrete Appl. Math."},{"key":"3007_CR5","volume-title":"Hypergraphs-Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs-Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)"},{"key":"3007_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, Hoboken (1976)"},{"key":"3007_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008379710317","volume":"16","author":"M Chateauneuf","year":"1999","unstructured":"Chateauneuf, M., Colbourn, C.J., Kreher, D.L.: Covering arrays of strength three. Des. Codes Cryptogr. 16, 235\u2013242 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"3007_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M Chateauneuf","year":"2002","unstructured":"Chateauneuf, M., Kreher, D.L.: On the state of strength-three coveing arrays. J. Combin. Des. 10, 217\u2013238 (2002)","journal-title":"J. Combin. Des."},{"key":"3007_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jcd.21350","volume":"22","author":"G Chen","year":"2014","unstructured":"Chen, G., Ji, L., Lei, J.: The existence of mixed orthogonal arrays with four and five factors of strength two. J. Combin. Des. 22, 323\u2013342 (2014)","journal-title":"J. Combin. Des."},{"key":"3007_CR10","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"MB Cohen","year":"2008","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math. 308, 2709\u20132722 (2008)","journal-title":"Discrete Math."},{"issue":"23","key":"3007_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"1997","author":"DM Cohen","year":"1997","unstructured":"Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Software Engrg. 1997(23), 437\u2013444 (1997)","journal-title":"IEEE Trans. Software Engrg."},{"key":"3007_CR12","first-page":"125","volume":"59","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J.: Combinatorial aspects of covering arrays. Matematiche. 59, 125\u2013172 (2004)","journal-title":"Combinatorial aspects of covering arrays. Matematiche."},{"key":"3007_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Trung, T.V., Walker, R.A.: Roux-type constructions for covering arrays of strength three and four. Des. Codes Cryptogr. 41, 33\u201357 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"3007_CR14","doi-asserted-by":"publisher","first-page":"3640","DOI":"10.1016\/j.jspi.2011.05.018","volume":"141","author":"CJ Colbourn","year":"2011","unstructured":"Colbourn, C.J., Shi, C., Wang, C., Yin, J.: Mixed covering arrays of strength three with few factors. J. Statist. Plann. Inference 141, 3640\u20133647 (2011)","journal-title":"J. Statist. Plann. Inference"},{"key":"3007_CR15","first-page":"85","volume":"16","author":"D de Werra","year":"1972","unstructured":"de Werra, D.: Decomposition of bipartite multigraphs into matchings. Z. Operations Res. Ser. A-B 16, 85\u201390 (1972)","journal-title":"Z. Operations Res. Ser. A-B"},{"key":"3007_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays-Theory and Applications","author":"AS Hedayat","year":"1999","unstructured":"Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays-Theory and Applications. Springer, New York (1999)"},{"key":"3007_CR17","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s11425-013-4616-y","volume":"56","author":"L Jiang","year":"2013","unstructured":"Jiang, L., Yin, J.: An approach of constructing mixed-level orthogonal arrays of strength $$\\geqslant 3$$. Sci China Math 56, 1109\u20131115 (2013)","journal-title":"Sci China Math"},{"key":"3007_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10623-008-9235-1","volume":"50","author":"Y Li","year":"2009","unstructured":"Li, Y., Ji, L., Yin, J.: Covering arrays of strength 3 and 4 from holey difference matrices. Des. Codes Cryptogr. 50, 339\u2013350 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"3007_CR19","doi-asserted-by":"publisher","first-page":"2150085","DOI":"10.1142\/S1793830921500853","volume":"14","author":"S Maity","year":"2022","unstructured":"Maity, S., Colbourn, C.J.: Mixed covering arrays on graphs of small treewidth. Discrete Math. Algorithms Appl. 14, 2150085 (2022)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"3007_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/jcd.20149","volume":"15","author":"K Meagher","year":"2007","unstructured":"Meagher, K., Moura, L., Zekaoui, L.: Mixed covering arrays on graphs. J. Combin. Des. 15, 393\u2013404 (2007)","journal-title":"J. Combin. Des."},{"key":"3007_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jctb.2005.03.005","volume":"95","author":"K Meagher","year":"2005","unstructured":"Meagher, K., Stevens, B.: Covering arrays on graphs. J. Combin. Theory Ser. B 95, 134\u2013151 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3007_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2019.10.022","volume":"800","author":"L Moura","year":"2019","unstructured":"Moura, L., Raaphorst, S., Stevens, B.: Upper bounds on the sizes of variable strength covering arrays using the Lov\u00e1sz local lemma. Theoret. Comput. Sci. 800, 146\u2013154 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"3007_CR23","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jcd.10059","volume":"11","author":"L Moura","year":"2003","unstructured":"Moura, L., Stardom, J., Stevens, B., Williams, A.: Covering arrays with mixed alphabet sizes. J. Combin. Des. 11, 413\u2013432 (2003)","journal-title":"J. Combin. Des."},{"key":"3007_CR24","unstructured":"Raaphorst, S.: Variable Strength Covering Arrays, PhD Thesis, University of Ottawa, Ottawa (2013)"},{"key":"3007_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/jcd.21602","volume":"26","author":"S Raaphorst","year":"2018","unstructured":"Raaphorst, S., Moura, L., Stevens, B.: Variable strength covering arrays. J. Comb. Des. 26, 417\u2013438 (2018)","journal-title":"J. Comb. Des."},{"key":"3007_CR26","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inform. Theory 34, 513\u2013522 (1988)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03007-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-03007-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03007-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:14:51Z","timestamp":1775715291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-03007-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3007"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-03007-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,5]]},"assertion":[{"value":"18 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"34"}}