{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T20:43:44Z","timestamp":1769114624972,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90354-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"117-126","source":"Crossref","is-referenced-by-count":103,"title":["Covering all cliques of a graph"],"prefix":"10.1016","volume":"86","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90354-K_BIB1","author":"Aigner","year":"1986","journal-title":"Vertex-sets that meet all maximal cliques of a graph"},{"key":"10.1016\/0012-365X(90)90354-K_BIB2","author":"Andreae","year":"1987","journal-title":"Covering the maximal cliques of a graph with at most half of its vertices"},{"key":"10.1016\/0012-365X(90)90354-K_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(90)90354-K_BIB4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(90)90354-K_BIB5","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s, T. Gallai and Zs. Tuza, Covering the cliques of a graph with vertices, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(92)90681-5"},{"key":"10.1016\/0012-365X(90)90354-K_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90354-K_BIB7","first-page":"133","article-title":"\u00dcber extreme Punkt- und Kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. L. E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0012-365X(90)90354-K_BIB8","series-title":"Thesis","article-title":"Extremal Problems on Graphs and Hypergraphs","author":"Tuza","year":"1983"},{"key":"10.1016\/0012-365X(90)90354-K_BIB9","unstructured":"Zs. Tuza, Matchings and coverings in regular uniform hypergraphs, to appear."},{"key":"10.1016\/0012-365X(90)90354-K_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01787474","article-title":"Transversal numbers of uniform hypergraphs","volume":"6","author":"Alon","year":"1990","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/0012-365X(90)90354-K_BIB11","doi-asserted-by":"crossref","unstructured":"T. Andreae, M. Schughart, and Zs. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(91)90055-7"},{"key":"10.1016\/0012-365X(90)90354-K_BIB12","doi-asserted-by":"crossref","unstructured":"Feng-Chu Lai and G.J. Chang, An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(90)90101-5"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090354K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090354K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:10Z","timestamp":1555120570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090354K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090354K"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90354-k","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}