{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:22:06Z","timestamp":1648797726727},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T00:00:00Z","timestamp":1259280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11786-009-0010-0","type":"journal-article","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T16:29:18Z","timestamp":1259339358000},"page":"31-38","source":"Crossref","is-referenced-by-count":0,"title":["Loose Cover of Graphs"],"prefix":"10.1007","volume":"3","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,27]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","volume":"28","author":"A.A. Bertossi","year":"1988","unstructured":"Bertossi A.A.: On the domatic number of interval graphs. Inf. Process. Lett. 28(6), 275\u2013280 (1988)","journal-title":"Inf. Process. Lett."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","volume":"12","author":"M.A. Bonuccelli","year":"1985","unstructured":"Bonuccelli M.A.: Dominating sets and domatic number of circular arc graphs. Discret. Appl. Math. 12, 203\u2013213 (1985)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0895480196311328","volume":"13","author":"S. Fujita","year":"2000","unstructured":"Fujita S., Yamashita M., Kameda T.: A study of r-configurations\u2014a resource assignment problem on graphs. SIAM J. Discret. Math. 13(2), 227\u2013254 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, Inc., New York (1998)"},{"key":"10_CR5","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., New York (1998)"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J. Kratochvil","year":"1997","unstructured":"Kratochvil J., Proskurowski A., Telle J.: Covering regular graphs. J. Comb. Theory B 71(1), 1\u201316 (1997)","journal-title":"J. Comb. Theory B"},{"issue":"3","key":"10_CR7","first-page":"173","volume":"5","author":"J. Kratochvil","year":"1998","unstructured":"Kratochvil J., Proskurowski A., Telle J.: Complexity of graph covering problems. Nord. J. Comput. 5(3), 173\u2013195 (1998)","journal-title":"Nord. J. Comput."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0403045","volume":"3","author":"T.L. Lu","year":"1990","unstructured":"Lu T.L., Ho P.H., Chang G.J.: The domatic number problem in interval graphs. SIAM J. Discret. Math. 3, 531\u2013536 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"10_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/0409015","volume":"9","author":"G.K. Manacher","year":"1996","unstructured":"Manacher G.K., Mankus T.A.: Finding a domatic partition of an interval graph in time O(n). SIAM J. Discret. Math. 9(2), 167\u2013172 (1996)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(92)90115-C","volume":"43","author":"S.L. Peng","year":"1992","unstructured":"Peng S.L., Chang M.S.: A simple linear time algorithm for the domatic partition problem on strongly chordal graphs. Inf. Process. Lett. 43, 297\u2013300 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","volume":"33","author":"A. Srinivasa Rao","year":"1989","unstructured":"Srinivasa Rao A., Rangan C.P.: Linear algorithm for domatic number problem on interval graphs. Inf. Process. Lett. 33(1), 29\u201333 (1989)","journal-title":"Inf. Process. Lett."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0010-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-009-0010-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0010-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:32:27Z","timestamp":1559428347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-009-0010-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,27]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s11786-009-0010-0","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,27]]}}}