{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:54:39Z","timestamp":1767192879813},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0012-365x(94)90151-1","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:41:28Z","timestamp":1034293288000},"page":"115-122","source":"Crossref","is-referenced-by-count":20,"title":["The domatic number problem"],"prefix":"10.1016","volume":"125","author":[{"given":"Gerald J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90151-1_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","article-title":"On the domatic number of interval graphs","volume":"28","author":"Bertossi","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(94)90151-1_BIB2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","article-title":"Dominating sets and domatic number of circular arc graphs","volume":"12","author":"Bonucelli","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)90151-1_BIB3","first-page":"141","article-title":"Domination of undirected graphs \u2014 a survey","volume":"642","author":"Cockayne","year":"1978"},{"key":"10.1016\/0012-365X(94)90151-1_BIB4","first-page":"41","article-title":"Optimal domination in graphs","volume":"CAS-22","author":"Cockayne","year":"1975","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0012-365X(94)90151-1_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0012-365X(94)90151-1_BIB6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)90151-1_BIB7","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(94)90151-1_BIB8","first-page":"728","article-title":"Relations du type Nordhans-Gaddum pour le nombre d'absorption d'un graphe simple","volume":"274","author":"Jaeger","year":"1972","journal-title":"C.R. Acad. Sci. Paris. Ser. A"},{"key":"10.1016\/0012-365X(94)90151-1_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0195-6698(87)80008-2","article-title":"Sur le nombre domatique du n-cube et une conjecture de Zelinka","volume":"8","author":"Laborde","year":"1987","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(94)90151-1_BIB10","first-page":"308","article-title":"On domination ralated concepts in graph theory","volume":"885","author":"Laskar","year":"1980"},{"key":"10.1016\/0012-365X(94)90151-1_BIB11","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0403045","article-title":"The domatic number problem in interval graphs","volume":"3","author":"Lu","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(94)90151-1_BIB12","article-title":"Thery of Graphs","volume":"38","author":"Ore","year":"1962","journal-title":"Amer. Math. Soc. Coll. Publ."},{"key":"10.1016\/0012-365X(94)90151-1_BIB13","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","article-title":"R-domination in graphs","volume":"23","author":"Slater","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(94)90151-1_BIB14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","article-title":"Linear algorithm for domatic number problem on interval graphs","volume":"33","author":"Rao","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(94)90151-1_BIB15","doi-asserted-by":"crossref","first-page":"486","DOI":"10.21136\/CMJ.1980.101697","article-title":"Domatically critical graphs","volume":"30","author":"Zelnika","year":"1980","journal-title":"Czech. Math. J."},{"key":"10.1016\/0012-365X(94)90151-1_BIB16","first-page":"91","article-title":"On domatic numbers of graphs","volume":"31","author":"Zelinka","year":"1981","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(94)90151-1_BIB17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.21136\/CPM.1981.108482","article-title":"Some remarks on domatic numbers of graphs","volume":"106","author":"Zelinka","year":"1981","journal-title":"\u010casopis P\u011bst Mat."},{"key":"10.1016\/0012-365X(94)90151-1_BIB18","first-page":"117","article-title":"Domatic numbers of cube graphs","volume":"32","author":"Zelinka","year":"1982","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(94)90151-1_BIB19","doi-asserted-by":"crossref","first-page":"82","DOI":"10.21136\/CPM.1983.118161","article-title":"Domatically cocritical graphs","volume":"108","author":"Zelinka","year":"1983","journal-title":"\u010casopis P\u011bst Mat."},{"key":"10.1016\/0012-365X(94)90151-1_BIB20","first-page":"145","article-title":"Domatic number and degrees of vertices of a graph","volume":"33","author":"Zelinka","year":"1983","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(94)90151-1_BIB21","series-title":"Graph Theory Lagow 1981","first-page":"278","article-title":"Domatic number and bichromaticity of a graph","volume":"1018","author":"Zelinka","year":"1983"},{"key":"10.1016\/0012-365X(94)90151-1_BIB22","first-page":"129","article-title":"Domatic numbers of uniform hypergraphs","volume":"21","author":"Zelinka","year":"1985","journal-title":"Arch. Math."},{"key":"10.1016\/0012-365X(94)90151-1_BIB23","doi-asserted-by":"crossref","unstructured":"B. Zelinka, Regular totally domatically full graphs, Ann. Discrete Math., to appear.","DOI":"10.1016\/S0167-5060(08)71039-2"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901511?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901511?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T13:57:31Z","timestamp":1622037451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0012365X94901511"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90151-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}