| |
| 2002 | ||
|---|---|---|
| 7 | EE | John Mitchem, Edward F. Schmeichel: The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electronic Notes in Discrete Mathematics 11: 491-502 (2002) |
| 1998 | ||
| 6 | S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50: (1998) | |
| 1997 | ||
| 5 | EE | John Mitchem, Patrick Morriss: On the cost-chromatic number of graphs. Discrete Mathematics 171(1-3): 201-211 (1997) |
| 1996 | ||
| 4 | EE | S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Star arboricity of graphs. Discrete Mathematics 149(1-3): 93-98 (1996) |
| 1990 | ||
| 3 | Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990) | |
| 1989 | ||
| 2 | EE | John Mitchem: On the harmonious chromatic number of a graph. Discrete Mathematics 74(1-2): 151-157 (1989) |
| 1976 | ||
| 1 | John Mitchem: On Various Algorithms for Estimating the Chromatic Number of a Graph. Comput. J. 19(2): 182-183 (1976) | |
| 1 | Anindo Bagchi | [3] |
| 2 | S. Louis Hakimi | [3] [4] [6] |
| 3 | Patrick Morriss | [5] |
| 4 | Edward F. Schmeichel | [3] [4] [6] [7] |