{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:11:07Z","timestamp":1748437867864,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12461065","12261074"],"award-info":[{"award-number":["12461065","12261074"]}],"id":[{"id":"10.13039\/100014718","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":[[2024,12]]},"DOI":"10.1007\/s00373-024-02840-2","type":"journal-article","created":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T23:02:37Z","timestamp":1728860557000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial Domination of Hypergraphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Minhui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-056X","authenticated-orcid":false,"given":"Shumin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,14]]},"reference":[{"issue":"2","key":"2840_CR1","first-page":"117","volume":"4","author":"BD Acharya","year":"2007","unstructured":"Acharya, B.D.: Domination in hypergraphs. AKCE Int. J. Graphs Comb. 4(2), 117\u2013126 (2007)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2840_CR2","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"issue":"7","key":"2840_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111879","volume":"343","author":"P Borg","year":"2020","unstructured":"Borg, P., Fenech, K., Kaemawichanurat, P.: Isolation of $$k$$-cliques. Discrete Math. 343(7), 111879 (2020)","journal-title":"Discrete Math."},{"key":"2840_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s00373-020-02143-2","volume":"36","author":"P Borg","year":"2020","unstructured":"Borg, P.: Isolation of cycles. Graphs Combin. 36, 631\u2013637 (2020)","journal-title":"Graphs Combin."},{"key":"2840_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph Theory: An Introduction","author":"A Bretto","year":"2013","unstructured":"Bretto, A.: Hypergraph Theory: An Introduction. Springer Publishing Company, Incorporated (2013)"},{"issue":"1","key":"2840_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejc.2011.08.002","volume":"33","author":"C Bujt\u00e1s","year":"2012","unstructured":"Bujt\u00e1s, C., Henning, M.A., Tuza, Z.: Transversals and domination in uniform hypergraphs. Eur. J. Combin. 33(1), 62\u201371 (2012)","journal-title":"Eur. J. Combin."},{"issue":"12","key":"2840_CR7","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.2298\/FIL1712925C","volume":"31","author":"Y Caro","year":"2017","unstructured":"Caro, Y., Hansberg, A.: Partial domination-the isolation number of a graph. Filomat 31(12), 3925\u20133944 (2017)","journal-title":"Filomat"},{"key":"2840_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.dam.2018.05.039","volume":"251","author":"Y Dong","year":"2018","unstructured":"Dong, Y., Shan, E., Kang, L., Li, S.: Domination in intersecting hypergraphs. Discrete Appl. Math. 251, 155\u2013159 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2840_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.2298\/AADM0902347J","volume":"3","author":"BK Jose","year":"2009","unstructured":"Jose, B.K., Tuza, Z.: Hypergraph domination and strong independence. Appl. Anal. Discrete Math. 3, 347\u2013358 (2009)","journal-title":"Appl. Anal. Discrete Math."},{"key":"2840_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.dam.2019.06.011","volume":"267","author":"S Tokunaga","year":"2019","unstructured":"Tokunaga, S., Jiarasuksakun, T., Kaemawichanurat, P.: Isolation number of maximal outerplanar graphs. Discrete Appl. Math. 267, 215\u2013218 (2019)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02840-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02840-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02840-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:06:51Z","timestamp":1733515611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02840-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2840"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02840-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,10,14]]},"assertion":[{"value":"7 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","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. Data sharing not applicable to this article as no datasets were generated or analysed during the current study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"109"}}