Vertex covering with monochromatic pieces of few colours

zbMath1395.05091arXiv1711.01557MaRDI QIDQ1671656

Frank Mousset, Marlo Eugster

Publication date: 7 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01557

zbMATH Keywords

graph theorymonochromatic covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
• Monochromatic cycle partitions of graphs with large minimum degree
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Monochromatic bounded degree subgraph partitions
• Partitioning random graphs into monochromatic components
• Kneser's conjecture, chromatic number, and homotopy
• An improved bound for the monochromatic cycle partition number
• Ryser's conjecture for tripartite 3-graphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Vertex coverings by monochromatic cycles and trees
• Partitioning complete bipartite graphs by monochromatic cycles
• Monochromatic trees in random graphs
• Monochromatic cycle partitions of edge-colored graphs
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• The Chromatic Number of Kneser Hypergraphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs

This page was built for publication: Vertex covering with monochromatic pieces of few colours