{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:04:20Z","timestamp":1777539860933,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"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":[[1992,10]]},"DOI":"10.1016\/0012-365x(92)90681-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"279-289","source":"Crossref","is-referenced-by-count":50,"title":["Covering the cliques of a graph with vertices"],"prefix":"10.1016","volume":"108","author":[{"given":"Paul","family":"Erd\u0151s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Gallai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90681-5_BIB1","author":"Aigner","year":"1986","journal-title":"Vertex-sets that meet all maximal cliques of a graph"},{"key":"10.1016\/0012-365X(92)90681-5_BIB2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","article-title":"A note on Ramsey numbers","volume":"29","author":"Ajtai","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(92)90681-5_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90055-7","article-title":"Clique-tranversal sets of line graphs and complements of line graphs","volume":"88","author":"Andreae","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90681-5_BIB4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(92)90681-5_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190150110","article-title":"Improved lower bounds on k-independence","volume":"15","author":"Caro","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(92)90681-5_BIB6","doi-asserted-by":"crossref","first-page":"346","DOI":"10.4153\/CJM-1961-029-9","article-title":"Graph theory and probability II","volume":"13","author":"Erd\u0151s","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(92)90681-5_BIB7","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/0012-365X(92)90681-5_BIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0097-3165(87)90029-X","article-title":"Chains, antichains and fibres","volume":"44","author":"Lonc","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(92)90681-5_BIB9","first-page":"307","article-title":"A note on stable sets and colourings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/0012-365X(92)90681-5_BIB10","author":"Sands","year":"1989","journal-title":"private communication"},{"key":"10.1016\/0012-365X(92)90681-5_BIB11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","article-title":"Covering all cliques of a graph","volume":"86","author":"Tuza","year":"1990","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92906815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92906815?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:59Z","timestamp":1555129619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92906815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0012365X92906815"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90681-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}