{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T19:25:02Z","timestamp":1769109902203,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0095-8956(91)90007-7","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"90-95","source":"Crossref","is-referenced-by-count":81,"title":["Vertex coverings by monochromatic cycles and trees"],"prefix":"10.1016","volume":"51","author":[{"given":"P","family":"Erd\u0151s","sequence":"first","affiliation":[]},{"given":"A","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"L","family":"Pyber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(91)90007-7_BIB1","article-title":"Sur l'existence de deux cycles suppl\u00e9mentaires unicolor\u00e9s disjoints et de couleurs diff\u00e9rentes dans un graphe complet bicolore","author":"Ayel","year":"1979"},{"key":"10.1016\/0095-8956(91)90007-7_BIB2","unstructured":"A. Bialostocki and P. Dierker, \u201cMonochromatic Connected Subgraphs in a Multicoloring of the Complete Graph\u201d, Manuscript."},{"key":"10.1016\/0095-8956(91)90007-7_BIB3","first-page":"123","article-title":"On (n, k)-colorings of complete graphs","volume":"58","author":"Bierbrauer","year":"1987"},{"key":"10.1016\/0095-8956(91)90007-7_BIB4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","article-title":"The Ramsey number of a graph with bounded maximum degree","volume":"34","author":"Chvatal","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90007-7_BIB5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0095-8956(91)90007-7_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02579271","article-title":"Maximum degree and fractional matchings in uniform hypergraphs","volume":"1","author":"F\u00fcredi","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(91)90007-7_BIB7","unstructured":"Z. F\u00fcredi, Covering the complete graph by partitions, submitted for publication."},{"key":"10.1016\/0095-8956(91)90007-7_BIB8","first-page":"167","article-title":"On Ramsey type Problems","volume":"10","author":"Gerencs\u00e9r","year":"1967","journal-title":"Ann. Univ. Scio. Budapest E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0095-8956(91)90007-7_BIB9","author":"Graham","year":"1980"},{"key":"10.1016\/0095-8956(91)90007-7_BIB10","article-title":"Partition covers and blocking sets in hypergraphs","volume":"Vol. 71","author":"Gy\u00e1rf\u00e1s","year":"1977"},{"key":"10.1016\/0095-8956(91)90007-7_BIB11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190070116","article-title":"Vertex coverings by monochromatic paths and cycles","volume":"7","author":"Gy\u00e1rf\u00e1s","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(91)90007-7_BIB12","series-title":"Irregularities of Partitions","first-page":"89","article-title":"Covering complete graphs by monochromatic paths","volume":"Vol. 8","author":"Gy\u00e1rf\u00e1s","year":"1989"},{"key":"10.1016\/0095-8956(91)90007-7_BIB13","first-page":"277","article-title":"Decompositions of edge colored infinite complete graphs","volume":"52","author":"Hajnal","year":"1987"},{"key":"10.1016\/0095-8956(91)90007-7_BIB14","first-page":"56","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0095-8956(91)90007-7_BIB15","doi-asserted-by":"crossref","unstructured":"R. Rado, Monochromatic paths in graphs, Ann. Discrete Math. 3, 191\u2013194.","DOI":"10.1016\/S0167-5060(08)70507-7"},{"key":"10.1016\/0095-8956(91)90007-7_BIB16","unstructured":"Zs. Tuza, \u201cOn Special Cases of Rysers Conjecture\u201d, Manuscript."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T21:34:52Z","timestamp":1586036092000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895691900077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0095895691900077"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90007-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}