{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T21:59:07Z","timestamp":1776549547517,"version":"3.51.2"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0166-218x(99)00016-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"101-139","source":"Crossref","is-referenced-by-count":8,"title":["Domination number of the cross product of paths"],"prefix":"10.1016","volume":"94","author":[{"given":"Rachid","family":"Ch\u00e9rifi","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Lagraula","sequence":"additional","affiliation":[]},{"given":"Charles","family":"Payan","sequence":"additional","affiliation":[]},{"given":"Isma\u00efl","family":"Zighem","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(99)00016-5_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/jgt.3190170110","article-title":"The domination numbers of the 5 \u00d7 n and the 6 \u00d7 n grid graphs","volume":"17","author":"Chang","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00016-5_BIB2","first-page":"97","article-title":"Domination numbers of complete grid graphs, I","volume":"38","author":"Chang","year":"1994","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(95)00091-A","article-title":"On the domination number of cross products of graphs","volume":"145","author":"Gravier","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB5","first-page":"497","article-title":"An application of beatable dominating sets to algorithms for complete grid graphs","volume":"vol. 1","author":"Hare","year":"1995"},{"key":"10.1016\/S0166-218X(99)00016-5_BIB6","first-page":"81","article-title":"Algorithms for computing the domination number of k \u00d7 n complete grid graphs","volume":"55","author":"Hare","year":"1986"},{"key":"10.1016\/S0166-218X(99)00016-5_BIB7","first-page":"33","article-title":"On the domination number of products of graphs: I","volume":"18","author":"Jacobson","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(99)00016-5_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(93)E0167-W","article-title":"Dominating Cartesian products of cycles","volume":"59","author":"Klavzar","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(95)00058-Y","article-title":"Algebraic approach to fasciagraphs and rotagraphs","volume":"68","author":"Klavzar","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00016-5_BIB11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(96)00032-5","article-title":"On a Vizing-like conjecture for direct product graphs","volume":"156","author":"Klavzar","year":"1996","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000165?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000165?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:53:40Z","timestamp":1556132020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0166218X99000165"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00016-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}