{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:19:48Z","timestamp":1768738788886,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"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":["12271229"],"award-info":[{"award-number":["12271229"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10878-023-01078-7","type":"journal-article","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T14:06:33Z","timestamp":1692885993000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complete forcing numbers of complete and almost-complete multipartite graphs"],"prefix":"10.1007","volume":"46","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5385-6687","authenticated-orcid":false,"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"1078_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.dam.2009.11.004","volume":"158","author":"H Abeledo","year":"2010","unstructured":"Abeledo H, Atkinson GW (2010) A min-max theorem for plane bipartite graphs. Discrete Appl Math 158:375\u2013378","journal-title":"Discrete Appl Math"},{"key":"1078_CR2","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 JA, Murty USR (1976) Graph theory with applications. American Elsevier, New York, Macmillan, London"},{"key":"1078_CR3","first-page":"289","volume":"67","author":"J Cai","year":"2012","unstructured":"Cai J, Zhang H (2012) Global forcing number of some chemical graphs. MATCH Commun Math Comput Chem 67:289\u2013312","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1078_CR4","doi-asserted-by":"crossref","unstructured":"De Carvalho MH, Kothari N, Wang X, Lin Y (2020) Birkhoff-Von Neumann graphs that are PM-compact. SIAM J Discrete Math 34:1769\u20131790","DOI":"10.1137\/18M1202347"},{"key":"1078_CR5","first-page":"201","volume":"74","author":"W Chan","year":"2015","unstructured":"Chan W, Xu S, Nong G (2015) A linear-time algorithm for computing the complete forcing number and the Clar number of catacondensed hexagonal systems. MATCH Commun Math Comput Chem 74:201\u2013216","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1078_CR6","first-page":"161","volume":"25","author":"G Chartrand","year":"1997","unstructured":"Chartrand G, Gavlas H, Vandell RC, Harary F (1997) The forcing domination number of a graph. J Comb Math Comb Comput 25:161\u2013174","journal-title":"J Comb Math Comb Comput"},{"key":"1078_CR7","first-page":"93","volume":"66","author":"Z Che","year":"2011","unstructured":"Che Z, Chen Z (2011) Forcing on perfect matchings-A survey. MATCH Commun Math Comput Chem 66:93\u2013136","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1078_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10910-006-9056-2","volume":"41","author":"T Do\u0161li\u0107","year":"2007","unstructured":"Do\u0161li\u0107 T (2007) Global forcing number of benzenoid graphs. J Math Chem 41:217\u2013229","journal-title":"J Math Chem"},{"key":"1078_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S0004972700017883","volume":"41","author":"K Gray","year":"1990","unstructured":"Gray K (1990) On the minimum number of blocks defining a design. Bull Aust Math Soc 41:97\u2013112","journal-title":"Bull Aust Math Soc"},{"key":"1078_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01192587","volume":"6","author":"F Harary","year":"1991","unstructured":"Harary F, Klein DJ, \u017divkovi\u0107 TP (1991) Graphical properties of polyhexes: perfect matching vector and forcing. J Math Chem 6:295\u2013306","journal-title":"J Math Chem"},{"key":"1078_CR11","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1007\/s10910-021-01261-3","volume":"59","author":"X He","year":"2021","unstructured":"He X, Zhang H (2021) Complete forcing numbers of hexagonal systems. J Math Chem 59:1767\u20131784","journal-title":"J Math Chem"},{"key":"1078_CR12","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/s10910-022-01330-1","volume":"60","author":"X He","year":"2022","unstructured":"He X, Zhang H (2022) Complete forcing numbers of hexagonal systems II. J Math Chem 60:666\u2013680","journal-title":"J Math Chem"},{"issue":"9","key":"1078_CR13","first-page":"20","volume":"23","author":"X He","year":"2022","unstructured":"He X, Zhang H (2022) Complete forcing numbers of graphs. Ars Math Contemp 23(9):20","journal-title":"Ars Math Contemp"},{"key":"1078_CR14","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1002\/jcc.540080432","volume":"8","author":"DJ Klein","year":"1987","unstructured":"Klein DJ, Randi\u0107 M (1987) Innate degree of freedom of a graph. J Comput Chem 8:516\u2013521","journal-title":"J Comput Chem"},{"key":"1078_CR15","first-page":"39","volume":"7","author":"B Liu","year":"2016","unstructured":"Liu B, Bian H, Yu H (2016) Complete forcing numbers of polyphenyl systems, Iranian. J Math Chem 7:39\u201346","journal-title":"J Math Chem"},{"key":"1078_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1080\/10406638.2019.1600560","volume":"41","author":"B Liu","year":"2021","unstructured":"Liu B, Bian H, Yu H, Li J (2021) Complete forcing number of spiro hexagonal systems. Polycl Aromat Compd 41:511\u2013517","journal-title":"Polycl Aromat Compd"},{"key":"1078_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112756","volume":"345","author":"A Mohammadian","year":"2022","unstructured":"Mohammadian A (2022) On the forcing matching numbers of prisms of graphs. Discrete Math 345:112756","journal-title":"Discrete Math"},{"key":"1078_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0012-365X(96)00247-6","volume":"167","author":"ES Mahmoodian","year":"1997","unstructured":"Mahmoodian ES, Naserasr R, Zaker M (1997) Defining sets in vertex colorings of graphs and Latin rectangles. Discrete Math 167:451\u2013460","journal-title":"Discrete Math"},{"key":"1078_CR19","unstructured":"Randi\u0107 M, Klein D (1985) Kekul\u00e9 valence structures revisited. Innate degrees of freedom of $$\\pi $$-electron couplings. In: Trinajsti\u0107 N (ed) Mathematical and computational concepts in chemistry. John Wiley & Sons, New York, pp 274\u2013282"},{"key":"1078_CR20","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1016\/j.dam.2012.05.021","volume":"160","author":"J Sedlar","year":"2012","unstructured":"Sedlar J (2012) The global forcing number of the parallelogram polyhex. Discrete Appl Math 160:2306\u20132313","journal-title":"Discrete Appl Math"},{"key":"1078_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dam.2021.02.001","volume":"294","author":"L Shi","year":"2021","unstructured":"Shi L, Zhang H, Lin R (2021) Characterizing the fullerene graphs with the minimum forcing number 3. Discrete Appl Math 294:181\u2013204","journal-title":"Discrete Appl Math"},{"key":"1078_CR22","first-page":"47","volume":"38","author":"D Vuki\u010devi\u0107","year":"2007","unstructured":"Vuki\u010devi\u0107 D, Do\u0161li\u0107 T (2007) Global forcing number of grid graphs. Australas J Comb 38:47\u201362","journal-title":"Australas J Comb"},{"key":"1078_CR23","first-page":"169","volume":"9","author":"D Vuki\u010devi\u0107","year":"2004","unstructured":"Vuki\u010devi\u0107 D, Sedlar J (2004) Total forcing number of the triangular grid. Math Commun 9:169\u2013179","journal-title":"Math Commun"},{"key":"1078_CR24","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10878-013-9624-x","volume":"29","author":"S Xu","year":"2015","unstructured":"Xu S, Zhang H, Cai J (2015) Complete forcing numbers of catacondensed hexagonal systems. J Comb Opt 29:803\u2013814","journal-title":"J Comb Opt"},{"key":"1078_CR25","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-015-9881-y","volume":"32","author":"S Xu","year":"2016","unstructured":"Xu S, Liu X, Chan W, Zhang H (2016) Complete forcing numbers of primitive coronoids. J Comb Opt 32:318\u2013330","journal-title":"J Comb Opt"},{"key":"1078_CR26","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.dam.2013.08.020","volume":"162","author":"H Zhang","year":"2014","unstructured":"Zhang H, Cai J (2014) On the global forcing number of hexagonal systems. Discrete Appl Math 162:334\u2013347","journal-title":"Discrete Appl Math"},{"key":"1078_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.dam.2022.01.010","volume":"311","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Zhang H (2022) Relations between global forcing number and maximum anti-forcing number of a graph. Discrete Appl Math 311:85\u201396","journal-title":"Discrete Appl Math"},{"key":"1078_CR28","first-page":"13","volume":"85","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Zhang H (2021) The minimum forcing and anti-forcing numbers of convex hexagonal systems. MATCH Commun Math Comput Chem 85:13\u201325","journal-title":"MATCH Commun Math Comput Chem"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01078-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01078-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01078-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T10:16:05Z","timestamp":1695377765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01078-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,24]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01078-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,24]]},"assertion":[{"value":"9 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":2,"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":"Competing interests"}}],"article-number":"11"}}