{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:29:00Z","timestamp":1775093340329,"version":"3.50.1"},"reference-count":20,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10632,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a quick review of results and applications concerning dominating sets in graphs. The domatic number of a graph is defined and studied. It is seen that the theory of domination resembles the well known theory of colorings of graphs.<\/jats:p>","DOI":"10.1002\/net.3230070305","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:48:09Z","timestamp":1178855289000},"page":"247-261","source":"Crossref","is-referenced-by-count":361,"title":["Towards a theory of domination in graphs"],"prefix":"10.1002","volume":"7","author":[{"given":"E. J.","family":"Cockayne","sequence":"first","affiliation":[]},{"given":"S. T.","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"303","article-title":"Some Theorems on Coverings","volume":"5","author":"Aigner M.","year":"1970","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_2_1_3_2","volume-title":"Theory of Graphs and its Applications","author":"Berge C.","year":"1962"},{"key":"e_1_2_1_4_2","volume-title":"Graphs and Hypergraphs","author":"Berge C.","year":"1973"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0095-8956(71)90033-5","article-title":"On the Composition and Decomposition of Clutters","volume":"11","author":"Billera L. J.","year":"1971","journal-title":"J. Comb. Theory"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80087-6"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90065-7"},{"key":"e_1_2_1_8_2","unstructured":"Cockayne E. J.andS. T.Hedetniemi \u201cIndependence Graphs \u201dProc of 5th S.E. Conference on Combinatorics Graph Theory and Computing Boca Raton Florida 1974."},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"Cockayne E. J.andS. T.Hedetniemi \u201cOptimal Domination in Graphs \u201dIEEE Trans. Circuits & Systems CAS\u201022 1975 pp.41\u201344.","DOI":"10.1016\/0020-0190(75)90011-3"},{"key":"e_1_2_1_10_2","unstructured":"Cockayne E. J.andS. T.Hedetniemi \u201cInterpolation Systems \u201dProc of 3rd S.E. Conference on Combinatorics Graph Theory and Computing 1972 pp.117\u2013130."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80083-7"},{"key":"e_1_2_1_12_2","volume-title":"Proof Techniques in Graph Theory","author":"Gupta R. P.","year":"1969"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_14_2","unstructured":"Jaegar F.andC.Payan \u201cRelations du Type Nordhaus\u2010Gaddum Pour le Nombre d'Absorption d'un Graphe Simple \u201dC. R. Acad. Sc. Paris Series A t 274 1972 pp.728\u2013730."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(71)90051-3"},{"key":"e_1_2_1_16_2","volume-title":"Introduction to Combinatorial Mathematics","author":"Liu C. L.","year":"1968"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90006-4"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/14.2.183"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.2307\/2306658"},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","unstructured":"Ore O. Theory of Graphs Amer. Math. Soc. Colloq. Publ. 38 Providence 1962.","DOI":"10.1090\/coll\/038"},{"key":"e_1_2_1_21_2","first-page":"729","article-title":"A Bound on the External Stability Number of a Graph","volume":"164","author":"Vizing V. G.","year":"1965","journal-title":"Doklady A. N."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:48:57Z","timestamp":1699782537000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,9]]}},"alternative-id":["10.1002\/net.3230070305"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070305","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,9]]}}}