{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:08:58Z","timestamp":1770995338138,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-018-0303-9","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T13:15:32Z","timestamp":1526044532000},"page":"416-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Perfect graphs involving semitotal and semipaired domination"],"prefix":"10.1007","volume":"36","author":[{"given":"Teresa W.","family":"Haynes","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"key":"303_CR1","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1016\/j.disc.2015.03.014","volume":"338","author":"JD Alvarado","year":"2015","unstructured":"Alvarado JD, Dantas S, Rautenbach D (2015) Perfectly relating the domination, total domination, and paired domination numbers of a graph. Discrete Math 338:1424\u20131431","journal-title":"Discrete Math"},{"key":"303_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20165","volume":"53","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky M (2006) Berge trigraphs. J Graph Theory 53:1\u201355","journal-title":"J Graph Theory"},{"key":"303_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky M, Robertson N, Seymour PD, Thomas R (2006) The strong perfect graph theorem. Ann Math 164:51\u2013229","journal-title":"Ann Math"},{"key":"303_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0095-8956(76)90005-8","volume":"20","author":"V Chv\u00e1tal","year":"1976","unstructured":"Chv\u00e1tal V (1976) On the strong perfect graph conjecture. J Combin Theory Ser B 20:139\u2013141","journal-title":"J Combin Theory Ser B"},{"key":"303_CR5","first-page":"101","volume":"94","author":"WJ Desormeaux","year":"2014","unstructured":"Desormeaux WJ, Henning MA (2014) Paired domination in graphs: a survey and recent results. Util Math 94:101\u2013166","journal-title":"Util Math"},{"key":"303_CR6","first-page":"67","volume":"94","author":"W Goddard","year":"2014","unstructured":"Goddard W, Henning MA, McPillan CA (2014) Semitotal domination in graphs. Util Math 94:67\u201381","journal-title":"Util Math"},{"key":"303_CR7","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Dekker, Inc., New York"},{"key":"303_CR8","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, Inc., New York"},{"key":"303_CR9","first-page":"93","volume":"104","author":"TW Haynes","year":"2018","unstructured":"Haynes TW, Henning MA (2018) Semipaired domination in graphs. J Combin Math Combin Comput 104:93\u2013109","journal-title":"J Combin Math Combin Comput"},{"issue":"3","key":"303_CR10","doi-asserted-by":"publisher","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(3):199\u2013206","journal-title":"Networks"},{"key":"303_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00373-017-1769-4","volume":"33","author":"MA Henning","year":"2017","unstructured":"Henning MA (2017) Edge weighting functions on semitotal dominating sets. Graphs Combin 33:403\u2013417","journal-title":"Graphs Combin"},{"key":"303_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.disc.2014.01.021","volume":"324","author":"MA Henning","year":"2014","unstructured":"Henning MA, Marcon AJ (2014) On matching and semitotal domination in graphs. Discrete Math 324:13\u201318","journal-title":"Discrete Math"},{"issue":"1","key":"303_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.7151\/dmgt.1844","volume":"36","author":"MA Henning","year":"2016","unstructured":"Henning MA, Marcon AJ (2016a) Vertices contained in all or in no minimum semitotal dominating set of a tree. Discuss Math Graph Theory 36(1):71\u201393","journal-title":"Discuss Math Graph Theory"},{"issue":"4","key":"303_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00026-016-0331-z","volume":"20","author":"MA Henning","year":"2016","unstructured":"Henning MA, Marcon AJ (2016b) Semitotal domination in claw-free cubic graphs. Ann Combin 20(4):799\u2013813","journal-title":"Ann Combin"},{"key":"303_CR15","unstructured":"Henning MA, Yeo A (2013) Total domination in graphs (springer monographs in mathematics) 2013. ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6"},{"key":"303_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L (1972) A characterization of perfect graphs. J Combin Theory Ser B 13:95\u201398","journal-title":"J Combin Theory Ser B"},{"key":"303_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/jgt.3190200313","volume":"20","author":"IE Zverovich","year":"1995","unstructured":"Zverovich IE, Zverovich VE (1995) An induced subgraph characterization of domination perfect graphs. J Graph Theory 20:375\u2013395","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0303-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0303-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0303-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:30:58Z","timestamp":1557531058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0303-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0303-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"assertion":[{"value":"11 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}