Vertex covers by monochromatic pieces -- a survey of results and problems
From MaRDI portal
Publication:279224
DOI10.1016/j.disc.2015.07.007zbMath1334.05085arXiv1509.05539OpenAlexW1957684847MaRDI QIDQ279224
Publication date: 27 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05539
Related Items (17)
Decompositions of edge-colored infinite complete graphs into monochromatic paths ⋮ Covering complete partite hypergraphs by monochromatic components ⋮ Monochromatic loose path partitions in \(k\)-uniform hypergraphs ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Monochromatic tree covers and Ramsey numbers for set-coloured graphs ⋮ Covering random graphs with monochromatic trees ⋮ Problems close to my heart ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Monochromatic cycle partitions in random graphs ⋮ Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles ⋮ Towards Lehel's conjecture for 4-uniform tight cycles ⋮ Covering complete graphs by monochromatically bounded sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
- Monochromatic cycle partitions of graphs with large minimum degree
- Improved monochromatic loose cycle partitions in hypergraphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- A note on covering edge colored hypergraphs by monochromatic components
- Monochromatic loose-cycle partitions in hypergraphs
- Partition of graphs and hypergraphs into monochromatic connected parts
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Monochromatic bounded degree subgraph partitions
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- 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
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Partitioning by monochromatic trees
- Vertex coverings by monochromatic cycles and trees
- Partitioning complete bipartite graphs by monochromatic cycles
- Monochromatic path and cycle partitions in hypergraphs
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Monochromatic components in edge-colored complete uniform hypergraphs
- A Ramsey-type problem for paths in digraphs
- Sur le circuit hamiltonien bi-colore dans les graphes orientes
- A Ramsey-type problem in directed and bipartite graphs
- Calculating Ramsey Numbers by Partitioning Colored Graphs
- Monochromatic cycle partitions of edge-colored graphs
- A hypergraph blow-up lemma
- Monochromatic Cycle Partitions in Local Edge Colorings
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- 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
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Local colourings and monochromatic partitions in complete bipartite graphs
- Holes in graphs
This page was built for publication: Vertex covers by monochromatic pieces -- a survey of results and problems
