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].
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0908104-141354 |
| Date | 08 September 2004 |
| Creators | Li, Yi-Ling |
| Contributors | none, none, none, Xu-ding Zhu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0908104-141354 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0019 seconds