Vertex Colorings without Rainbow or Monochromatic Subgraphs

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.