{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:38Z","timestamp":1771036358906,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T00:00:00Z","timestamp":1451433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11371180"],"award-info":[{"award-number":["11371180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9986-3","type":"journal-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T00:41:07Z","timestamp":1451436067000},"page":"660-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Anti-forcing spectra of perfect matchings of graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Kai","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"9986_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2002.10.002","volume":"281","author":"P Adams","year":"2004","unstructured":"Adams P, Mahdian M, Mahmoodian ES (2004) On the forced matching numbers of bipartite graphs. Discret Math 281:1\u201312","journal-title":"Discret Math"},{"key":"9986_CR2","first-page":"147","volume":"30","author":"P Afshani","year":"2004","unstructured":"Afshani P, Hatami H, Mahmoodian ES (2004) On the spectrum of the forced matching number of graphs. Aust J Combin 30:147\u2013160","journal-title":"Aust J Combin"},{"key":"9986_CR3","first-page":"93","volume":"66","author":"Z Che","year":"2011","unstructured":"Che Z, Chen Z (2011) Forcing on perfect matchings\u2014a survey. MATCH Commun Math Comput Chem 66:93\u2013136","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00892-8","volume-title":"Kekul\u00e9 structures in benzenoid hydrocarbons. Lecture notes in chemistry","author":"SJ Cyvin","year":"1988","unstructured":"Cyvin SJ, Gutman I (1988) Kekul\u00e9 structures in benzenoid hydrocarbons. Lecture notes in chemistry, vol 46. Springer, Berlin"},{"key":"9986_CR5","first-page":"675","volume":"58","author":"H Deng","year":"2007","unstructured":"Deng H (2007) The anti-forcing number of hexagonal chains. MATCH Commun Math Comput Chem 58:675\u2013682","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR6","first-page":"183","volume":"60","author":"H Deng","year":"2008","unstructured":"Deng H (2008) The anti-forcing number of double hexagonal chains. MATCH Commun Math Comput Chem 60:183\u2013192","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jlac.19274540108","volume":"454","author":"K Fries","year":"1927","unstructured":"Fries K (1927) Uber byclische verbindungen und ihren vergleich mit dem naphtalin. Ann Chem 454:121\u2013324","journal-title":"Ann Chem"},{"key":"9986_CR8","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1006\/jagm.1995.1022","volume":"18","author":"H Gabow","year":"1995","unstructured":"Gabow H (1995) Centroids, representations and submodular flow. J Algorithms 18:586\u2013628","journal-title":"J Algorithms"},{"key":"9986_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1021\/ci00018a011","volume":"34","author":"P Hansen","year":"1994","unstructured":"Hansen P, Zheng M (1994) Bonds fixed by fixing bonds. J Chem Inform Comput Sci 34:297\u2013304","journal-title":"J Chem Inform Comput Sci"},{"key":"9986_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01192587","volume":"6","author":"F Harary","year":"1991","unstructured":"Harary F, Klein D, \u017divkovi\u0107 T (1991) Graphical properties of polyhexes: perfect matching vector and forcing. J Math Chem 6:295\u2013306","journal-title":"J Math Chem"},{"key":"9986_CR11","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1016\/j.dam.2011.05.006","volume":"159","author":"X Jiang","year":"2011","unstructured":"Jiang X, Zhang H (2011) On forcing matching number of boron-nitrogen fullerene graphs. Discret Appl Math 159:1581\u20131593","journal-title":"Discret Appl Math"},{"key":"9986_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103"},{"key":"9986_CR13","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1002\/jcc.540080432","volume":"8","author":"D Klein","year":"1987","unstructured":"Klein D, Randi\u0107 M (1987) Innate degree of freedom of a graph. J Comput Chem 8:516\u2013521","journal-title":"J Comput Chem"},{"key":"9986_CR14","doi-asserted-by":"publisher","unstructured":"Lei H, Yeh Y, Zhang H (2015) Anti-forcing numbers of perfect matchings of graphs. Discrete Appl Math. doi: 10.1016\/j.dam.2015.08.024","DOI":"10.1016\/j.dam.2015.08.024"},{"key":"9986_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(95)00116-9","volume":"72","author":"X Li","year":"1997","unstructured":"Li X (1997) Hexagonal systems with forcing single edges. Discret Appl Math 72:295\u2013301","journal-title":"Discret Appl Math"},{"key":"9986_CR16","volume-title":"Matching theory, annals of discrete mathematics","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory, annals of discrete mathematics, vol 29. Elsevier, Amsterdam"},{"key":"9986_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0012-365X(97)00266-5","volume":"190","author":"L Pachter","year":"1998","unstructured":"Pachter L, Kim P (1998) Forcing matchings on square grids. Discret Math 190:287\u2013294","journal-title":"Discret Math"},{"key":"9986_CR18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0012-365X(01)00228-X","volume":"245","author":"ME Riddle","year":"2002","unstructured":"Riddle ME (2002) The minimum forcing number for the torus and hypercube. Discret Math 245:283\u2013292","journal-title":"Discret Math"},{"key":"9986_CR19","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10910-006-9133-6","volume":"42","author":"D Vuki\u010devi\u0107","year":"2007","unstructured":"Vuki\u010devi\u0107 D, Trinajsti\u0107 N (2007) On the anti-forcing number of benzenoids. J Math Chem 42:575\u2013583","journal-title":"J Math Chem"},{"key":"9986_CR20","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/s10910-006-9223-5","volume":"43","author":"D Vuki\u010devi\u0107","year":"2008","unstructured":"Vuki\u010devi\u0107 D, Trinajsti\u0107 N (2008) On the anti-Kekul\u00e9 number and anti-forcing number of cata-condensed bezenoids. J Math Chem 43:719\u2013726","journal-title":"J Math Chem"},{"key":"9986_CR21","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10910-006-9208-4","volume":"43","author":"H Wang","year":"2008","unstructured":"Wang H, Ye D, Zhang H (2008) The forcing number of toroidal polyhexes. J Math Chem 43:457\u2013475","journal-title":"J Math Chem"},{"key":"9986_CR22","first-page":"493","volume":"70","author":"L Xu","year":"2013","unstructured":"Xu L, Bian H, Zhang F (2013) Maximum forcing number of hexagonal systems. MATCH Commun Math Comput Chem 70:493\u2013500","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR23","unstructured":"Yang Q, Zhang H, Lin Y (2015) On the anti-forcing number of fullerene graphs. MATCH Commun Math Comput Chem 74: 681\u2013700"},{"key":"9986_CR24","first-page":"179","volume":"19","author":"F Zhang","year":"1986","unstructured":"Zhang F, Chen R (1986) A theorem concerning polyhex graphs. MATCH Commun Math Comput Chem 19:179\u2013188","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR25","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0012-365X(88)90233-6","volume":"72","author":"F Zhang","year":"1988","unstructured":"Zhang F, Guo X, Chen R (1988a) Z-transformation graphs of perfect matchings of hexagonal systems. Discret Math 72:405\u2013415","journal-title":"Discret Math"},{"key":"9986_CR26","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02006061","volume":"4","author":"F Zhang","year":"1988","unstructured":"Zhang F, Guo X, Chen R (1988b) The connectivity of Z-transformation graphs of perfect matching of hexagonal systems. Acta Math Appl Sin 4:131\u2013135","journal-title":"Acta Math Appl Sin"},{"key":"9986_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(93)E0184-6","volume":"140","author":"F Zhang","year":"1995","unstructured":"Zhang F, Li X (1995) Hexagonal systems with forcing edges. Discret Math 140:253\u2013263","journal-title":"Discret Math"},{"key":"9986_CR28","first-page":"333","volume":"24","author":"F Zhang","year":"1989","unstructured":"Zhang F, Li X (1989) Clar formula of a class of hexagonal system. MATCH Commun Math Comput Chem 24:333\u2013347","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR29","first-page":"327","volume":"8","author":"H Zhang","year":"1995","unstructured":"Zhang H (1995) The Clar formulas of regular $$t$$ t -tier strip benzenoid systems. Syst Sci Math Sci 8:327\u2013337","journal-title":"Syst Sci Math Sci"},{"key":"9986_CR30","first-page":"457","volume":"73","author":"H Zhang","year":"2015","unstructured":"Zhang H, Deng K (2015) Forcing spectrum of a hexagonal system with a forcing edge. MATCH Commun Math Comput Chem 73:457\u2013471","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9986_CR31","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.dam.2009.10.013","volume":"158","author":"H Zhang","year":"2010","unstructured":"Zhang H, Ye D, Shiu WC (2010) Forcing matching numbers of fullerene graphs. Discret Appl Math 158:573\u2013582","journal-title":"Discret Appl Math"},{"key":"9986_CR32","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0166-218X(00)00204-3","volume":"105","author":"H Zhang","year":"2000","unstructured":"Zhang H, Zhang F (2000) Plane elementary bipartite graphs. Discret Appl Math 105:291\u2013311","journal-title":"Discret Appl Math"},{"key":"9986_CR33","first-page":"799","volume":"65","author":"Q Zhang","year":"2011","unstructured":"Zhang Q, Bian H, Vumar E (2011) On the anti-kekul\u00e9 and anti-forcing number of cata-condensed phenylenes. MATCH Commun Math Comput Chem 65:799\u2013806","journal-title":"MATCH Commun Math Comput Chem"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9986-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9986-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9986-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9986-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9986-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,30]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9986"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9986-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,30]]}}}