This thesis studies the circular chromatic number of Kneser
graphs. It was known that if m is
greater than 2n^{2}(n-1), then the Kneser graph KG(m,n) has its circular chromatic number
equal its chromatic number . In particular, if
n = 3, then KG(m,3) has its circular chromatic number equal its
chromatic number when m is greater than 36. In this thesis, we improve
this result by proving that if m is
greaer than 24, then chi_c(KG(m,3)) = chi(KG(m,3)).
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0705104-163710 |
| Date | 05 July 2004 |
| Creators | Hsieh, Chin-chih |
| Contributors | Xuding.Zhu, S. C. Liaw, Sen-Peng Eu, H.G.Yeh |
| 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-0705104-163710 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0022 seconds