The Harmonious Chromatic Number of Bipartite Graphs
碩士 === 大同大學 === 應用數學研究所 === 89 === A harmonious coloring of a simple graph G is a coloring of the vertices such that adjacent vertices receive distinct colors and each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83233078084255049728 |