{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:45Z","timestamp":1759063665408},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,11,1]],"date-time":"1985-11-01T00:00:00Z","timestamp":499651200000},"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":10120,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,11]]},"DOI":"10.1016\/0166-218x(85)90025-3","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"203-213","source":"Crossref","is-referenced-by-count":48,"title":["Dominating sets and domatic number of circular arc graphs"],"prefix":"10.1016","volume":"12","author":[{"given":"Maurizio A.","family":"Bonuccelli","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90025-3_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination numbers of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quart. Appl. Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB3","first-page":"1607","article-title":"On the topology of the genetic fine structure","volume":"45","author":"Benzer","year":"1959"},{"key":"10.1016\/0166-218X(85)90025-3_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(85)90025-3_BIB5","first-page":"159","article-title":"Minimum node disjoint path covering for circular-arc graphs","volume":"8","author":"Bonuccelli","year":"1979"},{"issue":"1","key":"10.1016\/0166-218X(85)90025-3_BIB6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90025-3_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph-theoretic parameters concerning domination, independence, and irredundance","volume":"3","author":"Bollobas","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(85)90025-3_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(85)90025-3_BIB9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","article-title":"Contributions to the theory of domination, independence and irredundance in graphs","volume":"33","author":"Cockayne","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB10","first-page":"41","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975"},{"key":"10.1016\/0166-218X(85)90025-3_BIB11","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/TCS.1975.1083994","article-title":"Optimal domination in graphs","volume":"22","author":"Cockayne","year":"1975","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(85)90025-3_BIB12","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\/0166-218X(85)90025-3_BIB13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(76)90026-1","article-title":"Disjoint independent dominating sets in graphs","volume":"15","author":"Cockayne","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB14","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\/0166-218X(85)90025-3_BIB15","doi-asserted-by":"crossref","unstructured":"M. Farber and J.M. Keil, Domination in permutation graphs, J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(85)90001-X"},{"key":"10.1016\/0166-218X(85)90025-3_BIB16","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(85)90025-3_BIB17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90025-3_BIB18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(85)90025-3_BIB19","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(85)90025-3_BIB20","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","article-title":"An optimal solution for the channel-assignment problem","volume":"28","author":"Gupta","year":"1979","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0166-218X(85)90025-3_BIB21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB22","doi-asserted-by":"crossref","first-page":"810","DOI":"10.2307\/2317880","article-title":"What are the intersection graphs of arcs in a circle?","volume":"76","author":"Klee","year":"1969","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(85)90025-3_BIB23","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0602012","article-title":"An O(n2) algorithm for coloring proper circular-arc graphs","volume":"2","author":"Orlin","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90025-3_BIB24","series-title":"Discrete Mathematical Models","author":"Roberts","year":"1976"},{"key":"10.1016\/0166-218X(85)90025-3_BIB25","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"},{"issue":"Suppl. 1","key":"10.1016\/0166-218X(85)90025-3_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcp.1040700403","article-title":"Circular genetic maps","volume":"70","author":"Stahl","year":"1967","journal-title":"J. Cell Physiology"},{"key":"10.1016\/0166-218X(85)90025-3_BIB27","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular arcs","volume":"29","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(85)90025-3_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"An efficient test for circular-arc graphs","volume":"9","author":"Tucker","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T10:51:16Z","timestamp":1554893476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["0166218X85900253"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90025-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}