On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
From MaRDI portal
Publication:2380463
Recommendations
Cited in
(7)- On colorings of the Boolean lattice avoiding a rainbow copy of a poset
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
- Rainbow generalizations of Ramsey theory: A survey
- A note on the monotonicity of mixed Ramsey numbers
- Avoiding rainbow induced subgraphs in vertex-colorings
This page was built for publication: On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380463)