Login / Signup

Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number.

Carlos HoppenYoshiharu KohayakawaHanno Lefmann
Published in: Electron. Notes Discret. Math. (2011)
Keyphrases
  • fixed number
  • small number
  • computational complexity
  • directed graph
  • graph theory
  • weighted graph
  • finite number
  • spanning tree
  • undirected graph
  • graph coloring