{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T04:42:18Z","timestamp":1778992938047,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T00:00:00Z","timestamp":1427155200000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00453-015-9989-6","type":"journal-article","created":{"date-parts":[[2015,3,23]],"date-time":"2015-03-23T10:02:25Z","timestamp":1427104945000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["A New Characterization of $$P_k$$ P k -Free Graphs"],"prefix":"10.1007","volume":"75","author":[{"given":"Eglantine","family":"Camby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,24]]},"reference":[{"key":"9989_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating cliques in $${P}_5$$ P 5 -free graphs. Period. Math. Hungar. 21, 303\u2013308 (1990)","journal-title":"Period. Math. Hungar."},{"key":"9989_CR2","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.ejc.2011.12.008","volume":"34","author":"H Broersma","year":"2013","unstructured":"Broersma, H., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring $${P}_k$$ P k -free graphs. Euro. J. Combin. 34, 609\u2013619 (2013)","journal-title":"Euro. J. Combin."},{"key":"9989_CR3","doi-asserted-by":"crossref","unstructured":"Camby, E., Schaudt, O.: The price of connectivity for dominating sets: upper bounds and complexity. Discrete Appl. Math. 177, 53\u201359 (2014)","DOI":"10.1016\/j.dam.2014.05.029"},{"key":"9989_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"9989_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","volume":"86","author":"MB Cozzens","year":"1990","unstructured":"Cozzens, M.B., Kelleher, L.L.: Dominating cliques in graphs. Discrete Math. 86, 101\u2013116 (1990)","journal-title":"Discrete Math."},{"key":"9989_CR6","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)"},{"key":"9989_CR7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"CT Ho\u00e1ng","year":"2010","unstructured":"Ho\u00e1ng, C.T., Kaminski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding $$k$$ k -colorability of $${P}_5$$ P 5 -free graphs in polynomial time. Algorithmica 57, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"9989_CR8","doi-asserted-by":"crossref","unstructured":"Huang, S.: Improved complexity results on $$k$$ k -coloring $${P}_t$$ P t -free graphs. In: Proceedings of the MFCS, pp. 551\u2013558 (2013)","DOI":"10.1007\/978-3-642-40313-2_49"},{"key":"9989_CR9","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.dam.2006.11.005","volume":"155","author":"J Liu","year":"2007","unstructured":"Liu, J., Peng, Y., Zhao, C.: Characterization of $${P}_6$$ P 6 -free graphs. Discrete Appl. Math. 155, 1038\u20131043 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9989_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0012-365X(93)E0111-G","volume":"135","author":"J Liu","year":"1994","unstructured":"Liu, J., Zhou, H.: Dominating subgraphs in graphs with some forbidden structures. Discrete Math. 135, 163\u2013168 (1994)","journal-title":"Discrete Math."},{"key":"9989_CR11","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in $${P}_5$$ P 5 -free graphs in polynomial time. In: Proceedings of the SODA, pp. 570\u2013581 (2014)","DOI":"10.1137\/1.9781611973402.43"},{"key":"9989_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: 3-Colorability $$\\in {\\cal P}$$ \u2208 P for $${P}_6$$ P 6 -free graphs. Discrete Appl. Math. 136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9989_CR13","doi-asserted-by":"crossref","unstructured":"van\u2019t Hof, P., Paulusma, D.: A new characterization of $${P}_6$$ P 6 -free graphs. In: Proceedings of the COCOON, pp. 415\u2013424 (2008)","DOI":"10.1007\/978-3-540-69733-6_41"},{"key":"9989_CR14","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.dam.2008.08.025","volume":"158","author":"P van\u2019t Hof","year":"2010","unstructured":"van\u2019t Hof, P., Paulusma, D.: A new characterization of $${P}_6$$ P 6 -free graphs. Discrete Appl. Math. 158, 731\u2013740 (2010)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9989-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9989-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9989-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T04:30:01Z","timestamp":1566448201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9989-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,24]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9989"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9989-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,24]]}}}