Minimum Vertex Chromatic Sum on Block Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 89 === A vertex-coloring of a graph G=(V,E) is to color its all vertices with positive integer such that no adjacent vertices get the same color. The problem of minimum vertex chromatic sum of a graph is to color vertices such that the sum of all assigned col...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61604328556160967124 |