Login / Signup

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.

Cristina BazganAmel Harkat-BenhamdineHao LiMariusz Wozniak
Published in: Discret. Math. (2001)
Keyphrases
  • graph kernels
  • labeled graphs
  • structured objects
  • structured data
  • spanning tree
  • multiagent evolutionary algorithm
  • minimum cost
  • undirected graph
  • random graphs
  • minimum length
  • square error