A Four-Color Algorithm in Triangulated Planar Graphs
碩士 === 國立臺灣科技大學 === 資訊工程系 === 90 === In general, a triangulated planar graph is four-colorable. In this thesis, we prove that it all internal vertices are of even degrees, then the triangulated planar graph is three-colorable. Moreover, a triangulated planar graph needs four colors when i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15219086297922524604 |