| |
| 1999 | ||
|---|---|---|
| 4 | EE | K. H. Chew: Total chromatic number of graphs of odd order and high degree. Discrete Mathematics 205(1-3): 39-46 (1999) |
| 1997 | ||
| 3 | EE | K. H. Chew: On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs. Discrete Mathematics 171(1-3): 283-286 (1997) |
| 1996 | ||
| 2 | EE | K. H. Chew: Total chromatic number of regular graphs of odd order and high degree. Discrete Mathematics 154(1-3): 41-51 (1996) |
| 1 | EE | K. H. Chew: The chromatic index of graphs of high maximum degree. Discrete Mathematics 162(1-3): 77-91 (1996) |