{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:26:37Z","timestamp":1649179597747},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"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":3425,"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":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00246-2","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"61-80","source":"Crossref","is-referenced-by-count":0,"title":["Graph covers using t-colourable vertex sets"],"prefix":"10.1016","volume":"278","author":[{"given":"Sylvain","family":"Gravier","sequence":"first","affiliation":[]},{"given":"Jeannette","family":"Janssen","sequence":"additional","affiliation":[]},{"given":"Kyriakos","family":"Kilakos","sequence":"additional","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00246-2_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0012-365X(89)90193-3","article-title":"A min\u2013max relation for the partial q-colourings of a graph","volume":"74","author":"Berge","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB2","unstructured":"K. Cameron, Polyhedral and algorithmic ramifications of antichains, Ph.D. Thesis, University of Waterloo, 1982."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(89)90194-5","article-title":"A min\u2013max relation for the partial q-colourings of a graph, Part ii: Box perfection","volume":"74","author":"Cameron","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(92)90585-4","article-title":"Coflow polyhedra","volume":"101","author":"Cameron","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB5","first-page":"230","article-title":"Balanced schedules","volume":"9","author":"De Werra","year":"1971","journal-title":"Inform. J."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min\u2013max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Programming"},{"issue":"12","key":"10.1016\/S0012-365X(03)00246-2_BIB8","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0012-365X(03)00246-2_BIB9","series-title":"Telecommunications Network Planning","article-title":"Tile covers, closed tours and the radio spectrum","author":"Janssen","year":"1999"},{"key":"10.1016\/S0012-365X(03)00246-2_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00246-2_BIB11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/imamat\/9.1.23","article-title":"The solution of a timetabling problem","volume":"9","author":"McDiarmid","year":"1971","journal-title":"J. Inst. Math. Appl."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:25:55Z","timestamp":1551047155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002462"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00246-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}