The 2-hamiltonian cubes of graphs. - Khee Meng Koh; Kee L. Teo (J. Graph Theory, 1989)

The search for chromatically unique graphs. - Khee Meng Koh; Kee L. Teo (Graphs Comb., 1990)

Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. - Khee Meng Koh; Kee L. Teo (Discret. Math., 1994)

Partition of a directed bipartite graph into two directed cycles. - Hong Wang 005; Charles H. C. Little; Kee L. Teo (Discret. Math., 1996)

Preface. - C. C. Chen; Gek Ling Chia; Khee Meng Koh; N. Z. Li; Kee L. Teo (Discret. Math., 1997)

The search for chromatically unique graphs - II. - Khee Meng Koh; Kee L. Teo (Discret. Math., 1997)

Chromatic equivalence classes of certain generalized polygon trees. - Yee-Hock Peng; C. H. C. Little; Kee L. Teo; Hong Wang 005 (Discret. Math., 1997)

On a Conjecture on Directed Cycles in a Directed Bipartite Graph. - Charles H. C. Little; Kee L. Teo; Hong Wang 005 (Graphs Comb., 1997)

Chromatically unique bipartite graphs with low 3-independent partition numbers. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

An attempt to classify bipartite graphs by chromatic polynomials. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo (Graphs Comb., 2001)

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; C. H. C. Little; Michael D. Hendy (J. Graph Theory, 2001)

Two invariants for adjointly equivalent graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Australas. J Comb., 2002)

Zeros of adjoint polynomials of paths and cycles. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Australas. J Comb., 2002)

The vertex-cover polynomial of a graph. - Feng Ming Dong; Michael D. Hendy; Kee L. Teo; Charles H. C. Little (Discret. Math., 2002)

A note on the chromaticity of some 2-connected (n, n+3)-graphs. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh (Discret. Math., 2002)

Non-chordal graphs having integral-root chromatic polynomials II. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh; Michael D. Hendy (Discret. Math., 2002)

Chromaticity of some families of dense graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2002)

Graph-functions associated with an edge-property. - Feng Ming Dong; Michael D. Hendy; Kee L. Teo; Charles H. C. Little (Australas. J Comb., 2004)

Chromatically Unique Multibridge Graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy; Khee Meng Koh (Electron. J. Comb., 2004)

A new proof of a characterisation of Pfaffian bipartite graphs. - Serguei Norine; Charles H. C. Little; Kee L. Teo (J. Comb. Theory B, 2004)

A new expression for the adjoint polynomial of a path. - Jianfeng Wang; Kee L. Teo; Qiongxiang Huang; Chengfu Ye; Ruying Liu (Australas. J Comb., 2009)