| 2004 |
|---|
| 10 | EE | Feng Ming Dong,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy,
Khee Meng Koh:
Chromatically Unique Multibridge Graphs.
Electr. J. Comb. 11(1): (2004) |
| 9 | EE | Serguei Norine,
Charles H. C. Little,
Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs.
J. Comb. Theory, Ser. B 91(1): 123-126 (2004) |
| 2002 |
|---|
| 8 | EE | Feng Ming Dong,
Kee L. Teo,
Khee Meng Koh:
A note on the chromaticity of some 2-connected (n, n+3)-graphs.
Discrete Mathematics 243(1-3): 217-221 (2002) |
| 7 | EE | Feng Ming Dong,
Kee L. Teo,
Khee Meng Koh,
Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II.
Discrete Mathematics 245(1-3): 247-253 (2002) |
| 6 | EE | Feng Ming Dong,
Michael D. Hendy,
Kee L. Teo,
Charles H. C. Little:
The vertex-cover polynomial of a graph.
Discrete Mathematics 250(1-3): 71-78 (2002) |
| 5 | EE | Feng Ming Dong,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
Chromaticity of some families of dense graphs.
Discrete Mathematics 258(1-3): 303-321 (2002) |
| 2001 |
|---|
| 4 | EE | Feng Ming Dong,
Khee Meng Koh,
Kee L. Teo:
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs.
Graphs and Combinatorics 17(4): 611-635 (2001) |
| 2000 |
|---|
| 3 | EE | Feng Ming Dong,
Khee Meng Koh,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
An attempt to classify bipartite graphs by chromatic polynomials.
Discrete Mathematics 222(1-3): 73-88 (2000) |
| 2 | EE | Feng Ming Dong,
Khee Meng Koh,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discrete Mathematics 224(1-3): 107-124 (2000) |
| 1996 |
|---|
| 1 | EE | Hong Wang,
Charles H. C. Little,
Kee L. Teo:
Partition of a directed bipartite graph into two directed cycles.
Discrete Mathematics 160(1-3): 283-289 (1996) |
