This paper investigates vertex colorings of graphs such that some rainbow subgraph \(R\) and some monochromatic subgraph \(M\) are forbidden. Previous work focused on the case that \(R = M\). Here we consider the more general case, especially the case that \(M = K_2\).
Citation
Wayne Goddard, Honghai Xu. Vertex Colorings Without Rainbow or Monochromatic Subgraph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 102. 109-122. .