{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T01:19:48Z","timestamp":1774315188161,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0012-365x(93)e0216-q","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:16Z","timestamp":1027616836000},"page":"141-154","source":"Crossref","is-referenced-by-count":55,"title":["Ordered colourings"],"prefix":"10.1016","volume":"142","author":[{"given":"Meir","family":"Katchalski","sequence":"first","affiliation":[]},{"given":"William","family":"McCuaig","sequence":"additional","affiliation":[]},{"given":"Suzanne","family":"Seager","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0216-Q_BIB1","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","article-title":"Clique tree inequalities and the symmetric travelling salesman problem","volume":"11","author":"Gr\u00f6tschel","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB2","series-title":"Graph theory with applications","author":"Bondy","year":"1981"},{"issue":"2","key":"10.1016\/0012-365X(93)E0216-Q_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01588786","article-title":"Optimizing over the subtour polytope of the travelling salesman problem","volume":"49","author":"Boyd","year":"1990","journal-title":"Math. Program. Ser. A"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB4","article-title":"Subgraphs and well-quasi-ordering","author":"Ding","year":"1990"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","article-title":"On the problem of partitioning planar graphs, SIAM","volume":"3","author":"Dzhidzhev","year":"1982","journal-title":"J. Algorith. Discrete Meth."},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB6","first-page":"326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB7","article-title":"Analysis of parallelism in assembly operations","author":"Iyer","year":"1987"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB8","article-title":"Optimal node ranking of trees","author":"Iyer","year":"1987"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB9","article-title":"Ordered colourings","author":"Katchalski","year":"1988"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB10","series-title":"Proc. 21st Annu. IEEE Symp. on Foundations of Computer Science","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB11","series-title":"Proc. Conf. on Theoretical Computer Science","first-page":"1","article-title":"A separator theorem for planar graphs","author":"Lipton","year":"1977"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(89)90025-5","article-title":"Local optimization on graphs","volume":"23","author":"Llewellyn","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB13","article-title":"Ordered colourings of line graphs of trees","author":"McCuaig","year":"1988"},{"key":"10.1016\/0012-365X(93)E0216-Q_BIB14","series-title":"Surveys in Combinatorics 1985","first-page":"153","article-title":"Graph minors \u2014 a survey","volume":"103","author":"Robertson","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0216Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0216Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T07:58:26Z","timestamp":1556179106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0216Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0012365X93E0216Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0216-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}