{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:25:03Z","timestamp":1773152703158,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"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":10243,"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":[[1985,7]]},"DOI":"10.1016\/0012-365x(85)90045-7","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"167-180","source":"Crossref","is-referenced-by-count":56,"title":["Covering and coloring problems for relatives of intervals"],"prefix":"10.1016","volume":"55","author":[{"given":"A.","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90045-7_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","article-title":"On a coloring problem","volume":"8","author":"Asplund","year":"1960","journal-title":"Math. Scand."},{"key":"10.1016\/0012-365X(85)90045-7_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(85)90045-7_BIB3","first-page":"333","article-title":"Problem 56","volume":"1","author":"Bielicki","year":"1948","journal-title":"Colloq. Math."},{"key":"10.1016\/0012-365X(85)90045-7_BIB4","series-title":"Ph.D. Thesis","article-title":"On coloring problems of families of prototypes","author":"Burling","year":"1965"},{"key":"10.1016\/0012-365X(85)90045-7_BIB5","first-page":"101","article-title":"Helly's theorem and its relatives","volume":"Vol. VII","author":"Danzer","year":"1963"},{"key":"10.1016\/0012-365X(85)90045-7_BIB6","series-title":"Theory of Graphs","first-page":"115","article-title":"On directed paths and circuits","author":"Gallai","year":"1968"},{"key":"10.1016\/0012-365X(85)90045-7_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(85)90045-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0601001","article-title":"Extremal values of the interval number of a graph","volume":"1","author":"Griggs","year":"1980","journal-title":"SIAM J. Algebraic Discrete Maths."},{"key":"10.1016\/0012-365X(85)90045-7_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","article-title":"On the chromatic number of multiple interval graphs and overlap graphs","volume":"55","author":"Gy\u00e1rf\u00e1s","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(85)90045-7_BIB10","series-title":"Combinatorial Theory and its Application","first-page":"571","article-title":"A Helly-type problem in trees","author":"Gy\u00e1rf\u00e1s","year":"1970"},{"key":"10.1016\/0012-365X(85)90045-7_BIB11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02579191","article-title":"Hypergraph families with bounded edge cover or transversal number","volume":"3","author":"Gy\u00e1rf\u00e1s","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(85)90045-7_BIB12","unstructured":"J. Lehel, Gallai-type results for multiple boxes and forests, to appear."},{"key":"10.1016\/0012-365X(85)90045-7_BIB13","unstructured":"J. Lehel, A 5-coloring algorithm for triangle-free overlap graphs, manuscript."},{"key":"10.1016\/0012-365X(85)90045-7_BIB14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1112\/plms\/s2-50.7.509","article-title":"Covering theorems for ordered sets","volume":"50","author":"Rado","year":"1948","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0012-365X(85)90045-7_BIB15","series-title":"Recent Progress in Combinatorics","first-page":"301","article-title":"On the boxicity and cubicity of a graph","author":"Roberts","year":"1969"},{"key":"10.1016\/0012-365X(85)90045-7_BIB16","first-page":"127","article-title":"Nombre chromatique et plus longs chemins d'un graphe","volume":"1","author":"Roy","year":"1967","journal-title":"RAIRO Automat."},{"key":"10.1016\/0012-365X(85)90045-7_BIB17","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190030302","article-title":"On double and multiple interval graphs","volume":"3","author":"Trotter","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(85)90045-7_BIB18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular arcs","volume":"3","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900457?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900457?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:22:12Z","timestamp":1555190532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85900457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0012365X85900457"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90045-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}