Vertex Colorings without Rainbow or Monochromatic Subgraphs
Abstract
This paper investigates vertex colorings of graphs such that some rainbow subgraph~R and some monochromatic subgraph M are forbidden. Previous work focussed on the case that R=M. Here we consider the more general case, especially the case that M=K2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.