Login / Signup

Chromatic number of distance graphs generated by the sets {2, 3, x, y}.

Daphne Der-Fen LiuAileen Sutedja
Published in: J. Comb. Optim. (2013)
Keyphrases
  • small number
  • computational complexity
  • memory requirements
  • newly generated
  • fixed number
  • bipartite graph
  • finite number
  • maximum number
  • graph theoretic
  • minimum distance