{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:45:48Z","timestamp":1770972348796,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T00:00:00Z","timestamp":1217030400000},"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":[[2010,5]]},"DOI":"10.1007\/s10878-008-9177-6","type":"journal-article","created":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T10:09:13Z","timestamp":1216980553000},"page":"457-470","source":"Crossref","is-referenced-by-count":43,"title":["Labelling algorithms for paired-domination problems in block and interval graphs"],"prefix":"10.1007","volume":"19","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":[[2008,7,26]]},"reference":[{"key":"9177_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth KS, Lueker GS (1976) Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13:335\u2013379","journal-title":"J Comput Syst Sci"},{"key":"9177_CR2","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1016\/j.dam.2007.05.011","volume":"155","author":"TCE Chen","year":"2007","unstructured":"Chen TCE, Kang LY, Ng CT (2007) Paired domination on interval and circular-arc graphs. Discrete Appl Math 155:2077\u20132086","journal-title":"Discrete Appl Math"},{"key":"9177_CR3","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":"9177_CR4","volume-title":"Fundamentals of domination in graphs","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998a) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"9177_CR5","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"9177_CR6","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":"9177_CR7","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":"9177_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-006-9022-8","volume":"14","author":"PD Sylvain Gravier","year":"2007","unstructured":"Sylvain Gravier PD, Henning MA (2007) Paired-domination in generalized claw-free graphs. J Comb Optim 14:1\u20137","journal-title":"J Comb Optim"},{"key":"9177_CR9","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-008-9177-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9177-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9177-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:13Z","timestamp":1559261893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9177-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,26]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9177"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9177-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,26]]}}}