Vertex covers by monochromatic pieces — A survey of results and problems

2015/08/25 by András Gyárfás, Andras Gyarfas · 33 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Colored #Combinatorics #Computer science #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Graph #Graph Labeling and Dimension Problems #Graph theory #Limits and Structures in Graph Theory #Mathematics #Monochromatic color #Physics #Vertex (graph theory) #math.CO #msc:05C15

paper · pdf · doi:10.1016/j.disc.2015.07.007

published in Discrete Mathematics 339(7), 1970-1977 (Elsevier BV) · Discrete Mathematics, 2015

openalex publication_date 2015/08/25 · arxiv created 2015/09/18 · arxiv updated 2015/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects. It is an expanded version of the talk with the same title at the Seventh Cracow Conference on Graph Theory, held in Rytro in September 14-19, 2014.

Citations

• Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
• Local colourings and monochromatic partitions in complete bipartite graphs
• Ryser's Conjecture for Tripartite 3-Graphs
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Monochromatic cycle partitions in local edge colourings