|
|||||
|
|
Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n 1 |
|
| Authors: | Yap, H. P. Chen, B. L. Fu, H. L. |
| Affiliation: | Department of Mathematics, National University of Singapore 10 Kent Ridge Crescent, Singapore 0511 Institute of Mathematics, Academia Sinica Nankang, Taipei 11529, Taiwan, Republic of China Department of Applied Mathematics, National Chiao Tung University 1001 Ta Hsueh Road, Hsinchu, Taiwan, Republic of China |
| Abstract: | Let G be a graph of order 2n + l having maximum degree 2n –1. We prove that the total chromatic number of G is 2n if andonly if e +  '  n, where w is a vertex of minimum degree in G, is the complement of G —w, e is the size of , and ' is the edge independence number of . |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ | |