Combinatorics of Graph Painting
碩士 === 國立交通大學 === 應用數學系 === 91 === The major part of this thesis studies some combinatorial properties of graph painting. A painting on a graph is an assignment of the color black or white to each vertex of the graph. We consider an algorithm which converts a painted graph to a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35220217971909597420 |