Login / Signup

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number.

Carlos HoppenYoshiharu KohayakawaHanno Lefmann
Published in: Eur. J. Comb. (2014)
Keyphrases
  • fixed number
  • undirected graph
  • computational complexity
  • graph matching
  • small number
  • graph structures
  • maximum clique