A Study on Local Harmonious Problems
碩士 === 東吳大學 === 資訊管理學系 === 98 === The harmonious chromatic number of graph G, denoted h(G), is the least number of colors which can be used to color V(G) such that adjacent vertices are colored differently and each color-pair occurs on the vertices of an edge at most once. In this paper, we genera...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71717411930930766780 |