| 2005 | ||
|---|---|---|
| j6 | S. M. R. Iravani, C. P. Teo: Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. Oper. Res. Lett. 33(4): 421-430 (2005) | |
| 1996 | ||
| j5 | K. M. Koh, C. P. Teo: Chromaticity of series-parallel graphs. Discrete Mathematics 154(1-3): 289-295 (1996) | |
| 1994 | ||
| j4 | C. P. Teo, K. M. Koh: On chromatic uniqueness of uniform subdivisions of graphs. Discrete Mathematics 128(1-3): 327-335 (1994) | |
| 1992 | ||
| j3 | C. P. Teo, K. M. Koh: The number of shortest cycles and the chromatic uniqueness of a graph. Journal of Graph Theory 16(1): 7-15 (1992) | |
| 1991 | ||
| j2 | K. M. Koh, C. P. Teo: The chromatic uniqueness of certain broken wheels. Discrete Mathematics 96(1): 65-69 (1991) | |
| 1990 | ||
| j1 | C. P. Teo, K. M. Koh: The chromaticity of complete bipartite graphs with at most one edge deleted. Journal of Graph Theory 14(1): 89-99 (1990) | |
| 1 | S. M. R. Iravani | |
| 2 | K. M. Koh |
Data released under the ODC-BY 1.0 license — See also our legal information page