Vertex coverings by monochromatic paths and cycles

Abstract

Abstract We survey some results on covering the vertices of 2‐colored complete graphs by two paths or by two cycles of different color. We show the role of these results in determining path Ramsey numbers and in algorithms for finding long monochromatic paths or cycles in 2‐colored complete graphs.