{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:29Z","timestamp":1759637969369},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_8","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"81-88","source":"Crossref","is-referenced-by-count":5,"title":["New Polynomial Case for Efficient Domination in P 6-free Graphs"],"prefix":"10.1007","author":[{"given":"T.","family":"Karthick","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"189","volume-title":"Application of Discrete Mathematics","author":"D.W. Bange","year":"1988","unstructured":"Bange, D.W., Barkauskas, A., Slater, P.J.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Application of Discrete Mathematics, pp. 189\u2013199. SIAM, Philadelphia (1988)"},{"key":"8_CR2","first-page":"1","volume":"159","author":"N. Biggs","year":"1996","unstructured":"Biggs, N.: Perfect codes in graphs. Journal of Combinatorial Theory, Series B\u00a0159, 1\u201311 (1996)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00453-008-9176-0","volume":"56","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Klembt, T., Lozin, V.V., Mosca, R.: On independent vertex sets in subclasses of apple-free graphs. Algorithmica\u00a056, 383\u2013393 (2010)","journal-title":"Algorithmica"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ipl.2014.02.007","volume":"114","author":"A. Brandst\u00e4dt","year":"2014","unstructured":"Brandst\u00e4dt, A., Le, V.B.: A note on efficient domination in a superclass of P\n                  5-free graphs. Information Processing Letters\u00a0114, 357\u2013359 (2014)","journal-title":"Information Processing Letters"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-40313-2_19","volume-title":"Mathematical Foundations of Computer Science 2013","author":"A. Brandst\u00e4dt","year":"2013","unstructured":"Brandst\u00e4dt, A., Milani\u010d, M., Nevries, R.: New polynomial cases of the weighted efficient domination problem. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol.\u00a08087, pp. 195\u2013206. Springer, Heidelberg (2013)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90147-2","volume":"48","author":"M.S. Chang","year":"1993","unstructured":"Chang, M.S., Liu, Y.C.: Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs. Information Processing Letters\u00a048, 205\u2013210 (1993)","journal-title":"Information Processing Letters"},{"key":"8_CR7","first-page":"215","volume":"11","author":"M.S. Chang","year":"1994","unstructured":"Chang, M.S., Liu, Y.C.: Polynomial algorithms for the weighted perfect domination problems on interval and circular-arc graphs. Journal of Information Sciences and Engineering\u00a011, 215\u2013222 (1994)","journal-title":"Journal of Information Sciences and Engineering"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(94)00067-3","volume":"63","author":"G.J. Chang","year":"1995","unstructured":"Chang, G.J., Pandurangan, C., Coorg, S.R.: Weighted independent perfect domination on co-comparability graphs. Discrete Applied Mathematics\u00a063, 215\u2013222 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR9","first-page":"141","volume":"3","author":"M.R. Fellows","year":"1991","unstructured":"Fellows, M.R., Hoover, M.N.: Perfect domination. Australasian Journal of Combinatorics\u00a03, 141\u2013150 (1991)","journal-title":"Australasian Journal of Combinatorics"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(75)90087-8","volume":"19","author":"P. Hammond","year":"1975","unstructured":"Hammond, P., Smith, D.: Perfect codes in the graphs Q\n                  \n                    k\n                  . Journal of Combinatorial Theory Series B\u00a019, 239\u2013255 (1975)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"8_CR11","volume-title":"Fundamentals of Dominiation in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Dominiation in Graphs. Marcel Dekker, New York (1998)"},{"key":"8_CR12","unstructured":"Karthick, T.: Maximum weight independent sets in (P\n                  6, banner)-free graphs (2013) (submitted for publication)"},{"key":"8_CR13","unstructured":"Karthick, T.: Efficient domination in certain classes of P\n                  6-free graphs (2014) (submitted for publication)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Karthick, T.: New polynomial case for efficient domination in P\n                  6-free graphs. arXiv:1409.1676 [cs.DM] (2014)","DOI":"10.1007\/978-3-319-14974-5_8"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Livingston, M., Stout, Q.: Distributing resources in hypercube computers. In: Proceedings of Third Conference on Hypercube Concurrent Computers and Applications, pp. 222\u2013231 (1988)","DOI":"10.1145\/62297.62324"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(98)00057-2","volume":"87","author":"C.L. Lu","year":"1998","unstructured":"Lu, C.L., Tang, C.Y.: Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Applied Mathematics\u00a087, 203\u2013211 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0166-218X(01)00184-6","volume":"117","author":"C.L. Lu","year":"2002","unstructured":"Lu, C.L., Tang, C.Y.: Weighted efficient domination problem on some perfect graphs. Discrete Applied Mathematics\u00a0117, 163\u2013182 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1002\/jgt.21685","volume":"73","author":"M. Milani\u010d","year":"2013","unstructured":"Milani\u010d, M.: Hereditary efficiently dominatable graphs. Journal of Graph Theory\u00a073, 400\u2013424 (2013)","journal-title":"Journal of Graph Theory"},{"key":"8_CR19","first-page":"83","volume":"112","author":"C.B. Smart","year":"1995","unstructured":"Smart, C.B., Slater, P.J.: Complexity results for closed neighborhood parameters. Congressus Numerantium\u00a0112, 83\u201396 (1995)","journal-title":"Congressus Numerantium"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0012-365X(92)90300-5","volume":"109","author":"P.M. Weichsel","year":"1992","unstructured":"Weichsel, P.M.: Distance regular subgraphs of a cube. Discrete Mathematics\u00a0109, 297\u2013306 (1992)","journal-title":"Discrete Mathematics"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1002\/jgt.3190180506","volume":"18","author":"P.M. Weichsel","year":"1994","unstructured":"Weichsel, P.M.: Dominating sets in n-cubes. Journal of Graph Theory\u00a018, 479\u2013488 (1994)","journal-title":"Journal of Graph Theory"},{"key":"8_CR22","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(90)90031-R","volume":"35","author":"C.C. Yen","year":"1990","unstructured":"Yen, C.C., Lee, R.C.T.: The weighted perfect domination problem. Information Processing Letters\u00a035, 295\u2013299 (1990)","journal-title":"Information Processing Letters"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(94)00138-4","volume":"66","author":"C.C. Yen","year":"1996","unstructured":"Yen, C.C., Lee, R.C.T.: The weighted perfect domination problem and its variants. Discrete Applied Mathematics\u00a066, 147\u2013160 (1996)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:03:52Z","timestamp":1559091832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}