{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T20:35:01Z","timestamp":1769114101432,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T00:00:00Z","timestamp":1408579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00493-014-2935-4","type":"journal-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T22:17:37Z","timestamp":1408573057000},"page":"507-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Partitioning 2-edge-colored graphs by monochromatic paths and cycles"],"prefix":"10.1007","volume":"34","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Bar\u00e1t","sequence":"additional","affiliation":[]},{"given":"D\u00e1niel","family":"Gerbner","sequence":"additional","affiliation":[]},{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,21]]},"reference":[{"key":"2935_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1017\/S0963548308009164","volume":"17","author":"P. Allen","year":"2008","unstructured":"P. Allen: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles, Combinatorics, Probability and Computing 17 (2008), 471\u2013486.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2935_CR2","volume-title":"Sur l\u2019existence de deux cycles supplementaires unicolor\u00e9s, disjoints et de couleurs differentes dans un graphe complet bicolore","author":"J. Ayel","year":"1979","unstructured":"J. Ayel: Sur l\u2019existence de deux cycles supplementaires unicolor\u00e9s, disjoints et de couleurs differentes dans un graphe complet bicolore, Thesis, University of Grenoble, (1979)."},{"key":"2935_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1017\/S0963548312000090","volume":"21","author":"F. S. Benevides","year":"2012","unstructured":"F. S. Benevides, T. Luczak, A. Scott, J. Skokan, M. White: Monochromatic cycles and the monochromatic circumference in 2-coloured graphs, Combin. Probab. Comput. 21 (2012), 57\u201387.","journal-title":"Combin. Probab. Comput."},{"key":"2935_CR4","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.jctb.2009.07.001","volume":"100","author":"S. Bessy","year":"2010","unstructured":"S. Bessy, S. Thomass\u00e9: Partitioning a graph into a cycle and an anticycle, a proof of Lehel\u2019s conjecture, Journal of Combinatorial Theory, Series B 100 (2010), 176\u2013180.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2935_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s, T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337\u2013356.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2935_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","volume":"51","author":"P. Erd\u0151s","year":"1991","unstructured":"P. Erd\u0151s, A. Gy\u00e1rf\u00e1s, L. Pyber: Vertex coverings by monochromatic cycles and trees, Journal of Combinatorial Theory, Series B 51 (1991), 90\u201395.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2935_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(74)90122-8","volume":"10","author":"R. J. Faudree","year":"1974","unstructured":"R. J. Faudree, S. L. Lawrence, T. D. Parsons, R. H. Schelp: Path-Cycle Ramsey numbers, Discrete Mathematics 10 (1974), 269\u2013277.","journal-title":"Discrete Mathematics"},{"key":"2935_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190070116","volume":"7","author":"A. Gy\u00e1rf\u00e1s","year":"1983","unstructured":"A. Gy\u00e1rf\u00e1s: Vertex coverings by monochromatic paths and cycles, Journal of Graph Theory 7 (1983), 131\u2013135.","journal-title":"Journal of Graph Theory"},{"key":"2935_CR9","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.jctb.2006.02.007","volume":"96","author":"A. Gy\u00e1rf\u00e1s","year":"2006","unstructured":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. S\u00e1rk\u00f6zy, E. Szemer\u00e9di: An improved bound for the monochromatic cycle partition number, Journal of Combinatorial Theory, Series B 96 (2006), 855\u2013873.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2935_CR10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1002\/jgt.20646","volume":"71","author":"A. Gy\u00e1rf\u00e1s","year":"2012","unstructured":"A. Gy\u00e1rf\u00e1s, G. Simonyi, \u00c1. T\u00f3th: Gallai colorings and domination in multipartite digraphs, J. Graph Theory 71 (2012), 278\u2013292.","journal-title":"J. Graph Theory"},{"key":"2935_CR11","first-page":"62","volume":"71","author":"A. Gy\u00e1rf\u00e1s","year":"1977","unstructured":"A. Gy\u00e1rf\u00e1s: Partition coverings and blocking sets in hypergraphs (in Hungarian), Communications of the Computer and Automation Institute of the Hungarian Academy of Sciences 71 (1977) 62.","journal-title":"Communications of the Computer and Automation Institute of the Hungarian Academy of Sciences"},{"key":"2935_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.jctb.2007.07.002","volume":"98","author":"A. Gy\u00e1rf\u00e1s","year":"2008","unstructured":"A. Gy\u00e1rf\u00e1s, J. Lehel, G. N. S\u00e1rk\u00f6zy, R. H. Schelp: Monochromatic Hamiltonian Berge cycles in colored complete hypergraphs, Journal of Combinatorial Theory, Ser. B 98 (2008), 342\u2013358.","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"2935_CR13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1002\/jgt.20231","volume":"55","author":"A. Gy\u00e1rf\u00e1s","year":"2007","unstructured":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. N. S\u00e1rk\u00f6zy, E. Szemer\u00e9di: Tripartite Ramsey numbers for paths, Journal of Graph Theory 55 (2007), 164\u2013170.","journal-title":"Journal of Graph Theory"},{"key":"2935_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00493-007-0043-4","volume":"27","author":"A. Gy\u00e1rf\u00e1s","year":"2007","unstructured":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. S\u00e1rk\u00f6zy, E. Szemer\u00e9di: Three-color Ramsey numbers for paths, Combinatorica 27 (2007), 35\u201369.","journal-title":"Combinatorica"},{"key":"2935_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.37236\/540","volume":"18","author":"A. Gy\u00e1rf\u00e1s","year":"2011","unstructured":"A. Gy\u00e1rf\u00e1s, M. Ruszink\u00f3, G. S\u00e1rk\u00f6zy, E. Szemer\u00e9di: Partitioning 3-colored complete graphs into three monochromatic cycles, Electronic Journal of Combinatorics 18 (2011), Nr. 53.","journal-title":"Electronic Journal of Combinatorics"},{"key":"2935_CR16","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.disc.2009.10.013","volume":"310","author":"A. Gy\u00e1rf\u00e1s","year":"2010","unstructured":"A. Gy\u00e1rf\u00e1s, G. N. S\u00e1rk\u00f6zy: Gallai colorings of non-complete graphs, Discrete Mathematics 310 (2010), 977\u2013980.","journal-title":"Discrete Mathematics"},{"key":"2935_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548311000599","volume":"21","author":"A. Gy\u00e1rf\u00e1s","year":"2012","unstructured":"A. Gy\u00e1rf\u00e1s, G. N. S\u00e1rk\u00f6zy: Star versus two stripes Ramsey numbers and a conjecture of Schelp, Combin. Probab. Comput. 21 (2012), 179\u2013186.","journal-title":"Combin. Probab. Comput."},{"key":"2935_CR18","series-title":"Bolyai Society Mathematical Studies","first-page":"295","volume-title":"Combinatorics, Paul Erd\u0151s is Eighty","author":"J. Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and M. Simonovits: Szemer\u00e9di\u2019s Regularity Lemma and its applications in Graph Theory, in: Combinatorics, Paul Erd\u0151s is Eighty (D. Mikl\u00f3s, V.T. S\u00f3s and T. Sz\u0151nyi, Eds.), 295\u2013352, Bolyai Society Mathematical Studies, Vol. 2, Budapest, 1996."},{"key":"2935_CR19","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. T. S\u00f3s, P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954) 50\u201357.","journal-title":"Colloq. Math."},{"key":"2935_CR20","doi-asserted-by":"crossref","DOI":"10.1090\/chel\/361","volume-title":"Combinatorial problems and exercises","author":"L. Lov\u00e1sz","year":"2007","unstructured":"L. Lov\u00e1sz: Combinatorial problems and exercises, 2nd Edition, American Mathematical Society, Providence, Rhode Island, 2007.","edition":"2nd Edition"},{"key":"2935_CR21","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jctb.1998.1874","volume":"75","author":"T. \u0141uczak","year":"1999","unstructured":"T. \u0141uczak: R(C n;C n;C n) \u2264 (4+o(1))n, Journal of Combinatorial Theory, Ser. B 75 (1999), 174\u2013187.","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"2935_CR22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0963548398003599","volume":"7","author":"T. \u0141uczak","year":"1998","unstructured":"T. \u0141uczak, V. R\u00f6dl, E. Szemer\u00e9di: Partitioning two-colored complete graphs into two monochromatic cycles, Probability, Combinatorics and Computing 7 (1998), 423\u2013436.","journal-title":"Probability, Combinatorics and Computing"},{"key":"2935_CR23","first-page":"355","volume":"8","author":"L. P\u00f3sa","year":"1963","unstructured":"L. P\u00f3sa: On the circuits of finite graphs, MTA Mat. Kut. Int. K\u00f6zl. 8 (1963), 355\u2013361.","journal-title":"MTA Mat. Kut. Int. K\u00f6zl."},{"key":"2935_CR24","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.endm.2011.10.020","volume":"38","author":"A. Pokrovskiy","year":"2011","unstructured":"A. Pokrovskiy: Partitioning 3-coloured complete graphs into three monochromatic paths, Electronic Notes in Discrete Mathematics 38 (2011) 717\u2013722.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2935_CR25","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jctb.2014.01.003","volume":"106","author":"A. Pokrovskiy","year":"2014","unstructured":"A. Pokrovskiy: Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Journal of Combinatorial Theory B 106 (2014), 70\u201397.","journal-title":"Journal of Combinatorial Theory B"},{"key":"2935_CR26","doi-asserted-by":"crossref","first-page":"1962","DOI":"10.1016\/j.disc.2007.04.049","volume":"308","author":"G. N. S\u00e1rk\u00f6zy","year":"2008","unstructured":"G. N. S\u00e1rk\u00f6zy: On 2-factors with k components, Discrete Mathematics 308 (2008), 1962\u20131972.","journal-title":"Discrete Mathematics"},{"key":"2935_CR27","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/jgt.20492","volume":"66","author":"G. N. S\u00e1rk\u00f6zy","year":"2011","unstructured":"G. N. S\u00e1rk\u00f6zy: Monochromatic cycle partitions of edge-colored graphs, Journal of graph theory 66 (2011), 57\u201364.","journal-title":"Journal of graph theory"},{"key":"2935_CR28","doi-asserted-by":"crossref","first-page":"2158","DOI":"10.1016\/j.disc.2011.09.015","volume":"312","author":"R. H. Schelp","year":"2012","unstructured":"R. H. Schelp: Some Ramsey-Tur\u00e1n type problems and related questions, Discrete Mathematics 312 (2012), 2158\u20132161.","journal-title":"Discrete Mathematics"},{"key":"2935_CR29","first-page":"399","volume-title":"Regular partitions of graphs","author":"E. Szemer\u00e9di","year":"1976","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, Colloques Internationaux C.N.R.S. N\u00b0 260 \u2014 Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay (1976), 399\u2013401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2935-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2935-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2935-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T14:41:26Z","timestamp":1598193686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2935-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,21]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["2935"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2935-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,21]]}}}