{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:50Z","timestamp":1725455030229},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334740"},{"type":"electronic","value":"9783642334757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_17","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T02:43:09Z","timestamp":1347072189000},"page":"240-249","source":"Crossref","is-referenced-by-count":2,"title":["The Algorithmic Complexity of k-Domatic Partition of Graphs"],"prefix":"10.1007","author":[{"given":"Hongyu","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1155\/S016117129000031X","volume":"13","author":"Y. Caro","year":"1990","unstructured":"Caro, Y., Roditty, Y.: A note on the k-domination number of a graph. Internat. J. Math. Math. Sci.\u00a013, 205\u2013206 (1990)","journal-title":"Internat. J. Math. Math. Sci."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E.J. Cockayne","year":"1977","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks\u00a07, 247\u2013261 (1977)","journal-title":"Networks"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/jgt.20279","volume":"57","author":"O. Favaron","year":"2008","unstructured":"Favaron, O., Hansberg, A., Volkmann, L.: On k-domination and minimum degree in graphs. J. Graph Theory\u00a057, 33\u201340 (2008)","journal-title":"J. Graph Theory"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2002","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput.\u00a032(1), 172\u2013195 (2002)","journal-title":"SIAM J. Comput."},{"key":"17_CR6","unstructured":"Fink, J.F., Jacobson, M.S.: n-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 282\u2013300 (1985)"},{"key":"17_CR7","unstructured":"Fink, J.F., Jacobson, M.S.: On n-domination, n-dependence and forbidden subgraphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 301\u2013311 (1985)"},{"key":"17_CR8","first-page":"265","volume":"40","author":"J. Fujisawa","year":"2008","unstructured":"Fujisawa, J., Hansberg, A., Kubo, T., Saito, A., Sugita, M., Volkmann, L.: Independence and 2-domination in bipartite graphs. Australas. J. Combin.\u00a040, 265\u2013268 (2008)","journal-title":"Australas. J. Combin."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0895480196311328","volume":"13","author":"S. Fujita","year":"2000","unstructured":"Fujita, S., Yamashita, M., Kameda, T.: A study on r-configurations \u2013 a resource assignment problem on graphs. SIAM J. Discrete Math.\u00a013, 227\u2013254 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Hansberg, A., Meierling, D., Volkmann, L.: Distance domination and distance irredundance in graphs. Electron. J. Comb.\u00a014 (2007)","DOI":"10.37236\/953"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T.: ST, and P.J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Islam, K., Akl, S.G., Meijer, H.: Maximizing the lifetime of wireless sensor networks through domatic partition. In: Proceedings of the 34th IEEE Conference on Local Computer Networks, LCN (2009)","DOI":"10.1109\/LCN.2009.5355161"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10587-009-0036-0","volume":"59","author":"K. K\u00e4mmerling","year":"2009","unstructured":"K\u00e4mmerling, K., Volkmann, L.: The k-domatic number of a graph. Czech. Math. J.\u00a059(2), 539\u2013550 (2009)","journal-title":"Czech. Math. J."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A. Meir","year":"1975","unstructured":"Meir, A., Moon, J.W.: Relations between packing and covering number of a tree. Pacific J. Math.\u00a061, 225\u2013233 (1975)","journal-title":"Pacific J. Math."},{"issue":"8","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1002\/wcm.662","volume":"9","author":"R. Misra","year":"2009","unstructured":"Misra, R., Mandal, C.: Efficient clusterhead rotation via domatic partition in self-organizing sensor networks. Wireless Communications & Mobile Computing\u00a09(8), 1040\u20131058 (2009)","journal-title":"Wireless Communications & Mobile Computing"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2006)","DOI":"10.1145\/1132905.1132922"},{"key":"17_CR19","first-page":"65","volume":"206","author":"R. Pepper","year":"2010","unstructured":"Pepper, R.: Implications of some observations about the k-domination number. Congr. Numer.\u00a0206, 65\u201371 (2010)","journal-title":"Congr. Numer."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.aml.2006.03.006","volume":"20","author":"D. Rautenbach","year":"2007","unstructured":"Rautenbach, D., Volkmann, L.: New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett.\u00a020, 98\u2013102 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"17_CR21","first-page":"157","volume":"1","author":"J.A. Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput.\u00a01(1), 157\u2013171 (1994)","journal-title":"Nord. J. Comput."},{"issue":"3","key":"17_CR22","first-page":"313","volume":"34","author":"B. Zelinka","year":"1984","unstructured":"Zelinka, B.: On k-ply domatic numbers of graphs. Math. Slovaca\u00a034(3), 313\u2013318 (1984)","journal-title":"Math. Slovaca"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T08:56:48Z","timestamp":1643360208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}