{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:54:39Z","timestamp":1659081279357},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T00:00:00Z","timestamp":1284422400000},"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":[[2012,2]]},"DOI":"10.1007\/s10878-010-9352-4","type":"journal-article","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T20:29:35Z","timestamp":1284409775000},"page":"252-260","source":"Crossref","is-referenced-by-count":3,"title":["The total {k}-domatic number of a graph"],"prefix":"10.1007","volume":"23","author":[{"given":"S. M.","family":"Sheikholeslami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,14]]},"reference":[{"key":"9352_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(99)00251-4","volume":"216","author":"X Baogen","year":"2000","unstructured":"Baogen X, Cockayne EJ, Haynes TW, Hedetniemi ST, Zhou S (2000) Extremal graphs for inequalities involving domination parameters. Discrete Math 216:1\u201310","journal-title":"Discrete Math"},{"key":"9352_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211\u2013219","journal-title":"Networks"},{"key":"9352_CR3","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Dekker, New York"},{"key":"9352_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10878-008-9144-2","volume":"18","author":"N Li","year":"2009","unstructured":"Li N, Hou X (2009) On the total {k}-domination number of Cartesian products of graphs. J\u00a0Comb Optim 18:173\u2013178","journal-title":"J\u00a0Comb Optim"},{"key":"9352_CR5","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West DB (2000) Introduction to graph theory. Prentice-Hall, Englewood Cliffs"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9352-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9352-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9352-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9352-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,14]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9352"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9352-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,14]]}}}