Contents

Vertex Colorings Without Rainbow or Monochromatic Subgraph

Wayne Goddard1, Honghai Xu1
1Dept of Mathematical Sciences, Clemson University Clemson SC 29634

Abstract

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\).