The Incidence Coloring Algorithm for Honeycomb Meshes, Square Meshes and Hexagonal Meshes
碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === In 1993, Brualdi and Massey conjectured that every graph can be incidence-colored with +2 colors, where is the maximum degree of a graph. In 2002, Wai Chee Shiu, Peter Che Bor Lam and Dong-Ling Chen showed that cubic Hamiltonian graphs and some othe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85212149457368387399 |