{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:59:13Z","timestamp":1768741153155,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T00:00:00Z","timestamp":1368576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10878-013-9624-x","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T09:24:09Z","timestamp":1368523449000},"page":"803-814","source":"Crossref","is-referenced-by-count":16,"title":["Complete forcing numbers of catacondensed hexagonal systems"],"prefix":"10.1007","volume":"29","author":[{"given":"Shou-Jun","family":"Xu","sequence":"first","affiliation":[]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jinzhuan","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,15]]},"reference":[{"key":"9624_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":"9624_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. Austral J Combin 30:147\u2013160","journal-title":"Austral J Combin"},{"key":"9624_CR3","unstructured":"Balakrishnan VK (1995) Theory and problems of combinatorics. Schaum\u2019s Outline Series, McGraw-Hill"},{"key":"9624_CR4","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":"9624_CR5","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"},{"issue":"4","key":"9624_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00493-012-2660-9","volume":"32","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky M, Seymour P (2012) Perfect matchings in planar cubic graphs. Combinatorica 32(4):403\u2013424","journal-title":"Combinatorica"},{"key":"9624_CR7","doi-asserted-by":"crossref","unstructured":"Cyvin SJ, Gutman I (1988) Kekul\u00e9 structures in benzenoid hydrocarbons, lecture notes in chemistry, vol 46. Springer, Berlin","DOI":"10.1007\/978-3-662-00892-8"},{"key":"9624_CR8","volume-title":"Graph theory","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory, 2nd edn. Springer, New York","edition":"2"},{"key":"9624_CR9","doi-asserted-by":"crossref","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":"9624_CR10","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1016\/j.aim.2011.03.015","volume":"227","author":"L Esperet","year":"2011","unstructured":"Esperet L, Kardo\u0161 F, King AD, Kr\u00e1l D, Norine S (2011) Exponentially many perfect matchings in cubic graphs. Adv Math 227:1646\u20131664","journal-title":"Adv Math"},{"key":"9624_CR11","doi-asserted-by":"crossref","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 Austral Math Soc 41:97\u2013112","journal-title":"Bull Austral Math Soc"},{"key":"9624_CR12","doi-asserted-by":"crossref","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":"9624_CR13","doi-asserted-by":"crossref","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":"9624_CR14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.disc.2005.11.001","volume":"306","author":"S Kleinerman","year":"2006","unstructured":"Kleinerman S (2006) Bounds on the forcing numbers of bipartite graphs. Discret Math 306:66\u201373","journal-title":"Discret Math"},{"key":"9624_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0304-3975(02)00499-1","volume":"303","author":"F Lam","year":"2003","unstructured":"Lam F, Pachter L (2003) Forcing numbers of stop signs. Theor Comput Sci 303:409\u2013416","journal-title":"Theor Comput Sci"},{"key":"9624_CR16","unstructured":"Lov\u00e1sz L., Plummer M. (1986) Matching theory, annals of discrete math., Vol. 29, North-Holland, Amsterdam"},{"issue":"168","key":"9624_CR17","doi-asserted-by":"crossref","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. Discret Math 167(168):451\u2013460","journal-title":"Discret Math"},{"key":"9624_CR18","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":"9624_CR19","first-page":"274","volume-title":"Mathematical and computational concepts in chemistry","author":"M Randi\u0107","year":"1985","unstructured":"Randi\u0107 M, Klein DJ (1985) Kekul\u00e9 valence structures revisited. Innate degrees of freedom of $$\\pi $$ \u03c0 -electron couplings. In: Trinajsti\u0107 N (ed) Mathematical and computational concepts in chemistry. Wiley, New York, pp 274\u2013282"},{"key":"9624_CR20","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":"9624_CR21","doi-asserted-by":"crossref","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. Discret Appl Math 160:2306\u20132313","journal-title":"Discret Appl Math"},{"key":"9624_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. Austral J Combin 38:47\u201362","journal-title":"Austral J Combin"},{"key":"9624_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":"9624_CR24","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":"9624_CR25","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9624-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9624-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9624-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9624-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,15]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9624"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9624-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,15]]}}}