Login / Signup

On the Number of 3-Edge Colorings of Cubic Graphs.

Christian Szegedy
Published in: Eur. J. Comb. (2002)
Keyphrases
  • small number
  • memory requirements
  • undirected graph
  • data mining
  • computational complexity
  • edge detection
  • directed graph
  • fixed number