{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:54Z","timestamp":1740107094438,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T00:00:00Z","timestamp":1591574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T00:00:00Z","timestamp":1591574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NS2020055"],"award-info":[{"award-number":["NS2020055"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501291"],"award-info":[{"award-number":["11501291"]}],"id":[{"id":"10.13039\/501100001809","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":[[2020,11]]},"DOI":"10.1007\/s00373-020-02192-7","type":"journal-article","created":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T10:05:46Z","timestamp":1591610746000},"page":"1723-1740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning Claw-Free Subcubic Graphs into Two Dominating Sets"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0196-9265","authenticated-orcid":false,"given":"Qing","family":"Cui","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"2192_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.7151\/dmgt.1996","volume":"38","author":"S Akbari","year":"2018","unstructured":"Akbari, S., Motiei, M., Mozaffari, S., Yazdanbod, S.: Cubic graphs with total domatic number at least two. Discuss. Math. Graph Theory 38, 75\u201382 (2018)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2192_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01864169","volume":"4","author":"N Alon","year":"1988","unstructured":"Alon, N., Bregman, Z.: Every $$8$$-uniform $$8$$-regular hypergraph is $$2$$-colorable. Graphs Combin. 4, 303\u2013306 (1988)","journal-title":"Graphs Combin."},{"key":"2192_CR3","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s00373-019-02063-w","volume":"35","author":"G Bacs\u00f3","year":"2019","unstructured":"Bacs\u00f3, G., Bujt\u00e1s, Cs, Tompkins, C., Tuza, Zs: Disjoint paired-dominating sets in cubic graphs. Graphs Combin. 35, 1129\u20131138 (2019)","journal-title":"Graphs Combin."},{"key":"2192_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2017.01.032","volume":"223","author":"WJ Desormeaux","year":"2017","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Partitioning the vertices of a cubic graph into two total dominating sets. Discret. Appl. Math. 223, 52\u201363 (2017)","journal-title":"Discret. Appl. Math."},{"key":"2192_CR5","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"key":"2192_CR6","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"2192_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discret. Math. 309, 32\u201363 (2009)","journal-title":"Discret. Math."},{"key":"2192_CR8","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1016\/j.ejc.2013.04.005","volume":"34","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: $$2$$-colorings in $$k$$-regular $$k$$-uniform hypergraphs. Eur. J. Combin. 34, 1192\u20131202 (2013)","journal-title":"Eur. J. Combin."},{"key":"2192_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs. Springer Monographs in Mathematics","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer Monographs in Mathematics, Springer, New York (2013)"},{"key":"2192_CR10","volume-title":"Ten Lectures on the Probabilistic Method","author":"J Spencer","year":"1987","unstructured":"Spencer, J.: Ten Lectures on the Probabilistic Method. SIAM, Philadelphia (1987)"},{"key":"2192_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1090\/S0894-0347-1992-1135027-1","volume":"5","author":"C Thomassen","year":"1992","unstructured":"Thomassen, C.: The even cycle problem for directed graphs. J. Am. Math. Soc. 5, 217\u2013229 (1992)","journal-title":"J. Am. Math. Soc."},{"key":"2192_CR12","first-page":"7","volume":"39","author":"B Zelinka","year":"1989","unstructured":"Zelinka, B.: Total domatic number and degrees of vertices of a graph. Math. Slovac. 39, 7\u201311 (1989)","journal-title":"Math. Slovac."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02192-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02192-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02192-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T23:49:43Z","timestamp":1623109783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02192-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,8]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2192"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02192-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,6,8]]},"assertion":[{"value":"27 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}