Shingo Okuma

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The harmonious coloring of an undirected simple graph is a vertex coloring such that adjacent vertices are assigned different colors and each pair of colors appears together on at most one edge. The harmonious chromatic number of a graph is the least number of colors used in such a coloring. The harmonious chromatic number of a path is known, whereas the(More)
  • 1