{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T13:14:07Z","timestamp":1777468447852,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00200-7","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"223-239","source":"Crossref","is-referenced-by-count":12,"title":["Gridline graphs: a review in two dimensions and an extension to higher dimensions"],"prefix":"10.1016","volume":"126","author":[{"given":"Dale","family":"Peterson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00200-7_BIB1","unstructured":"L. Beineke, I. Broere, Rooks\u2019 graphs, unpublished, 1995."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB2","first-page":"317","volume":"10","author":"Cook","year":"1974","journal-title":"Adjacency graphs, Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","article-title":"The list chromatic index of a bipartite multigraph","volume":"63","author":"Galvin","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00200-7_BIB4","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB5","unstructured":"V.A. Gurvich, M.A. Temkin, Checked perfect graphs, Soviet Math. Dokl. 326 (1992) 227\u2013232; Russian Acad. Sci. Dokl. Math. 46 (1993) 248\u2013253 (in English)."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB6","series-title":"Recent Trends in Graph Theory, Proceedings of the Conference, New York, 1970","first-page":"157","article-title":"Graphs of (0,1)-matrices","volume":"Vol. 186","author":"Hedetniemi","year":"1971"},{"key":"10.1016\/S0166-218X(02)00200-7_BIB7","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1214\/aoms\/1177703593","article-title":"On the line graph of the complete bipartite graph","volume":"34","author":"Hoffman","year":"1964","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB8","series-title":"Graph Theory and its Applications, Proceedings","first-page":"79","article-title":"On eigenvalues and colorings of graphs","author":"Hoffman","year":"1969"},{"key":"10.1016\/S0166-218X(02)00200-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(92)90028-V","article-title":"Kernels in perfect line-graphs","volume":"55","author":"Maffray","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00200-7_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0166-218X(99)00026-8","article-title":"Sequential colorings and perfect graphs","volume":"94","author":"Maffray","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB11","unstructured":"D. Peterson, Gridline graphs and higher dimensional extensions, RUTCOR research report RRR 3-95, Rutgers University, New Brunswick, NJ, 1995."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB12","unstructured":"D. Peterson, Gridline graphs and the choice number of perfect line graphs, RUTCOR dissertation RD #24, Rutgers University, New Brunswick, NJ, 1995."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(92)90270-P","article-title":"Convergence of iterated clique graphs","volume":"103","author":"Prisner","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB14","series-title":"Applied Combinatorics","author":"Roberts","year":"1984"},{"key":"10.1016\/S0166-218X(02)00200-7_BIB15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1137\/S0097539796299266","article-title":"Bipartite edge coloring in O(\u0394 m) time","volume":"28","author":"Schrijver","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00200-7_BIB16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","article-title":"Coloring perfect (K4\u29f9 e)-free graphs","volume":"42","author":"Tucker","year":"1987","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:50:16Z","timestamp":1554814216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":16,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002007"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00200-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}