A graph operation related to multiplicity of graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 92 === In this thesis we give two different proofs of the result chromatic number of a special graph is 4. The first proof is derived by analysing the structure of the special graph. The second proof is a method which was first studied in [1]....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/43852655627931340859 |