{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:59:20Z","timestamp":1768733960016,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T00:00:00Z","timestamp":1430352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10878-015-9881-y","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T05:41:33Z","timestamp":1430286093000},"page":"318-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Complete forcing numbers of primitive coronoids"],"prefix":"10.1007","volume":"32","author":[{"given":"Shou-Jun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiu-Song","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai Hong","family":"Chan","sequence":"additional","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,4,30]]},"reference":[{"key":"9881_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":"9881_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"},{"issue":"1","key":"9881_CR3","first-page":"201","volume":"74","author":"WH Chan","year":"2015","unstructured":"Chan WH, Xu S-J, 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(1):201\u2013216","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9881_CR4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF00809795","volume":"122","author":"SJ Cyvin","year":"1991","unstructured":"Cyvin SJ, Cyvin BN, Brunvoll J, Hosoya H, Zhang F, Klein DJ, Chen R, Polansky OE (1991) Kekul\u00e9 structure counts: general gormulations for primitive coronoid hydrocarbons. Monatsh Chem 122:435\u2013444","journal-title":"Monatsh Chem"},{"key":"9881_CR5","series-title":"Lecture notes in chemistry","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00892-8","volume-title":"Kekul\u00e9 structures in benzenoid hydrocarbons","author":"SJ Cyvin","year":"1988","unstructured":"Cyvin SJ, Gutman I (1988) Kekul\u00e9 structures in benzenoid hydrocarbons, vol 46., Lecture notes in chemistrySpringer, Berlin"},{"key":"9881_CR6","volume-title":"Graph theory","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory, 2nd edn. Springer, New York","edition":"2"},{"key":"9881_CR7","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 Aust Math Soc 41:97\u2013112","journal-title":"Bull Aust Math Soc"},{"key":"9881_CR8","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":"9881_CR9","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":"9881_CR10","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":"9881_CR11","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":"9881_CR12","volume-title":"Matching theory, annals of discrete math","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer M (1986) Matching theory, annals of discrete math, vol 29. North-Holland, Amsterdam"},{"issue":"168","key":"9881_CR13","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":"9881_CR14","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":"9881_CR15","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":"9881_CR16","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":"9881_CR17","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. Aust J Combin 38:47\u201362","journal-title":"Aust J Combin"},{"key":"9881_CR18","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":"9881_CR19","unstructured":"Xu S-J, Chang H, Xiao J-M (2015a) Complete forcing numbers of rectangular polyominoes, completed"},{"key":"9881_CR20","unstructured":"Xu S-J, Xiao J-M, Chang H (2015b) Complete forcing numbers of triangular benzenoid systems, completed"},{"key":"9881_CR21","doi-asserted-by":"crossref","unstructured":"Xu S-J, Zhang H, Cai J (2015c) Complete forcing numbers of catacondensed benzenoid. J Combin Optim 29(4):803\u2013814","DOI":"10.1007\/s10878-013-9624-x"},{"key":"9881_CR22","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":"9881_CR23","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-015-9881-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9881-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9881-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:26Z","timestamp":1559276606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9881-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9881"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9881-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]}}}