Pages that link to "Item:Q3483311"
From MaRDI portal
The following pages link to Monochromatic coverings in colored complete graphs (Q3483311):
Displaying 14 items.
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Monochromatic diameter-2 components in edge colorings of the complete graph (Q2233352) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- On modular monochromatic colorings of graphs (Q2878218) (← links)
- (Q3838200) (← links)
- (Q3977492) (← links)
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference (Q4595652) (← links)
- Monochromatic cycle covers in random graphs (Q4625023) (← links)
- Vertex covering with monochromatic paths (Q4841660) (← links)
- Covering complete graphs by monochromatically bounded sets (Q5028797) (← links)
- Monomial invariants applied to graph coloring (Q6116562) (← links)