English

Vertex Colorings without Rainbow or Monochromatic Subgraphs

Combinatorics 2016-01-27 v1

Abstract

This paper investigates vertex colorings of graphs such that some rainbow subgraph~RR and some monochromatic subgraph MM are forbidden. Previous work focussed on the case that R=MR=M. Here we consider the more general case, especially the case that M=K2M=K_2.

Keywords

Cite

@article{arxiv.1601.06920,
  title  = {Vertex Colorings without Rainbow or Monochromatic Subgraphs},
  author = {Wayne Goddard and Honghai Xu},
  journal= {arXiv preprint arXiv:1601.06920},
  year   = {2016}
}
R2 v1 2026-06-22T12:36:42.703Z