Pages that link to "Item:Q279224"
From MaRDI portal
The following pages link to Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224):
Displaying 17 items.
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Decompositions of edge-colored infinite complete graphs into monochromatic paths (Q2397547) (← links)
- Covering complete partite hypergraphs by monochromatic components (Q2404363) (← links)
- Monochromatic loose path partitions in \(k\)-uniform hypergraphs (Q2404368) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Covering complete graphs by monochromatically bounded sets (Q5028797) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)
- Problems close to my heart (Q6116410) (← links)
