{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:20:45Z","timestamp":1649096445014},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T00:00:00Z","timestamp":1294790400000},"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,10]]},"DOI":"10.1007\/s10878-011-9375-5","type":"journal-article","created":{"date-parts":[[2011,1,11]],"date-time":"2011-01-11T21:01:59Z","timestamp":1294779719000},"page":"176-191","source":"Crossref","is-referenced-by-count":1,"title":["Vertices in all minimum paired-dominating sets of\u00a0block graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Lei","family":"Chen","sequence":"first","affiliation":[]},{"given":"Changhong","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Zhenbing","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,12]]},"reference":[{"key":"9375_CR1","doi-asserted-by":"crossref","first-page":"5063","DOI":"10.1016\/j.tcs.2009.08.004","volume":"410","author":"L Chen","year":"2009","unstructured":"Chen L, Lu C, Zeng Z (2009a) Hardness results and approximation algorithms for (weighted) paired-domination in graphs. Theor Comput Sci 410:5063\u20135071","journal-title":"Theor Comput Sci"},{"key":"9375_CR2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ipl.2009.09.014","volume":"110","author":"L Chen","year":"2009","unstructured":"Chen L, Lu C, Zeng Z (2009b) A linear-time algorithm for paired-domination problem in strongly chordal graphs. Inf Process Lett 110:20\u201323","journal-title":"Inf Process Lett"},{"key":"9375_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10878-008-9177-6","volume":"19","author":"L Chen","year":"2010","unstructured":"Chen L, Lu C, Zeng Z (2010a) Labelling algorithms for paired-domination problems in block and interval graphs. J Comb Optim 19:457\u2013470","journal-title":"J Comb Optim"},{"key":"9375_CR4","unstructured":"Chen L, Lu C, Zeng Z (2010b) Graphs with unique minimum paired-dominating sets. Ars Comb (to appear)"},{"key":"9375_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0012-365X(02)00447-8","volume":"260","author":"EJ Cockayne","year":"2003","unstructured":"Cockayne EJ, Henning MA, Mynhardt CM (2003) Vertices contained in all or in no minimum total dominating set of a tree. Discrete Math 260:37\u201344","journal-title":"Discrete Math"},{"key":"9375_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-006-9022-8","volume":"14","author":"P Dorbec","year":"2007","unstructured":"Dorbec P, Gravier S, Henning MA (2007) Paired-domination in generalized claw-free graphs. J Comb Optim 14:1\u20137","journal-title":"J Comb Optim"},{"key":"9375_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O Favaron","year":"2004","unstructured":"Favaron O, Henning MA (2004) Paired-domination in claw-free cubic graphs. Graphs Comb 20:447\u2013456","journal-title":"Graphs Comb"},{"key":"9375_CR8","first-page":"65","volume":"109","author":"TW Haynes","year":"1995","unstructured":"Haynes TW, Slater PJ (1995) Paired-domination and the paired-domatic number. Congr Numer 109:65\u201372","journal-title":"Congr Numer"},{"key":"9375_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Slater PJ (1998) Paired-domination in graphs. Networks 32:199\u2013206","journal-title":"Networks"},{"key":"9375_CR10","volume-title":"Fundamentals of domination in graphs","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998a) Fundamentals of domination in graphs. Dekker, New York"},{"key":"9375_CR11","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in graphs: advanced topics. Dekker, New York"},{"key":"9375_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10878-006-9014-8","volume":"13","author":"MA Henning","year":"2007","unstructured":"Henning MA (2007) Graphs with large paired-domination number. J Comb Optim 13:61\u201378","journal-title":"J Comb Optim"},{"key":"9375_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10878-005-4107-3","volume":"10","author":"MA Henning","year":"2005","unstructured":"Henning MA, Plummer MD (2005) Vertices contained in all or in no minimum paired-dominating set of a tree. J Comb Optim 10:283\u2013294","journal-title":"J Comb Optim"},{"key":"9375_CR14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.tcs.2004.02.028","volume":"320","author":"L Kang","year":"2004","unstructured":"Kang L, Sohn MY, Cheng TCE (2004) Paired-domination in inflated graphs. Theor Comput Sci 320:485\u2013494","journal-title":"Theor Comput Sci"},{"key":"9375_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T","volume":"31","author":"CM Mynhardt","year":"1999","unstructured":"Mynhardt CM (1999) Vertices contained in every minimum dominating set of a tree. J Graph Theory 31:163\u2013177","journal-title":"J Graph Theory"},{"key":"9375_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1021338214295","volume":"25","author":"H Qiao","year":"2003","unstructured":"Qiao H, Kang LY, Caedei M, Du DZ (2003) Paired-domination of trees. J Glob Optim 25:43\u201354","journal-title":"J Glob Optim"},{"key":"9375_CR17","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, New York","edition":"2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9375-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9375-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9375-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9375-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9375"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9375-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,12]]}}}