{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:40:48Z","timestamp":1648806048806},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,12]],"date-time":"2007-10-12T00:00:00Z","timestamp":1192147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10898-007-9247-9","type":"journal-article","created":{"date-parts":[[2007,10,11]],"date-time":"2007-10-11T08:32:16Z","timestamp":1192091536000},"page":"385-399","source":"Crossref","is-referenced-by-count":1,"title":["Total domination in partitioned trees and partitioned graphs with minimum degree two"],"prefix":"10.1007","volume":"41","author":[{"given":"Allan","family":"Frendrup","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[]},{"given":"Preben Dahl","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,12]]},"reference":[{"key":"9247_CR1","volume-title":"Graphs & Digraphs","author":"G. Chartrand","year":"1996","unstructured":"Chartrand G. and Lesniak L. (1996). Graphs & Digraphs, 3rd edn. Chapman & Hall, London","edition":"3"},{"key":"9247_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"E.J. Cockayne","year":"1980","unstructured":"Cockayne E.J., Dawes R.M. and Hedetniemi S.T. (1980). Total domination in graphs. Networks 10: 211\u2013219","journal-title":"Networks"},{"key":"9247_CR3","first-page":"113","volume":"46","author":"B.L. Hartnell","year":"2003","unstructured":"Hartnell B.L. and Vestergaard P.D. (2003). Partitions and dominations in a graph. J. Combin. Math. Combin. Comput 46: 113\u2013128","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"9247_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J. (1998). Fundamentals of Domination in Graphs. Marcel Dekker, New York"},{"key":"9247_CR5","volume-title":"Domination in Graphs: Advanced Topics","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) (1998). Domination in Graphs: Advanced Topics. Marcel Dekker, New York"},{"key":"9247_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/1097-0118(200009)35:1<21::AID-JGT3>3.0.CO;2-F","volume":"35","author":"M.A. Henning","year":"2000","unstructured":"Henning M.A. (2000). Graphs with large total domination number. J. Graph Theory 35: 21\u201345","journal-title":"J. Graph Theory"},{"key":"9247_CR7","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1016\/j.disc.2006.07.024","volume":"307","author":"M.A. Henning","year":"2007","unstructured":"Henning M.A. and Vestergaard P.D. (2007). Domination in partitioned graphs with minimum degree two. Discrete Math 307: 1115\u20131135","journal-title":"Discrete Math"},{"key":"9247_CR8","first-page":"85","volume":"132","author":"S.M. Seager","year":"1998","unstructured":"Seager S.M. (1998). Partition dominations of graphs of minimum degree 2. Congress. Numer. 132: 85\u201391","journal-title":"Congress. Numer."},{"key":"9247_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.7151\/dmgt.1169","volume":"22","author":"Z. Tuza","year":"2002","unstructured":"Tuza Z. and Vestergaard P.D. (2002). Domination in partitioned graph. Discussiones Mathematicae Graph Theory 22: 199\u2013210","journal-title":"Discussiones Mathematicae Graph Theory"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9247-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9247-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9247-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:10Z","timestamp":1559290330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9247-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9247"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9247-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,12]]}}}