Kee L. Teo

Publication Activity (10 Years)

Years Active: 1989-2009
Publications (10 Years): 0

Publications

Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu
A new expression for the adjoint polynomial of a path. Australas. J Comb. 43 (2009)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
Graph-functions associated with an edge-property. Australas. J Comb. 30 (2004)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11 (1) (2004)
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) (2004)
Feng Ming Dong, Kee L. Teo, Khee Meng Koh
A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. 243 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25 (2002)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
The vertex-cover polynomial of a graph. Discret. Math. 250 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Chromaticity of some families of dense graphs. Discret. Math. 258 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25 (2002)
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245 (1-3) (2002)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37 (1) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17 (4) (2001)
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. Discret. Math. 224 (1-3) (2000)
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. Discret. Math. 222 (1-3) (2000)
Charles H. C. Little, Kee L. Teo, Hong Wang
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13 (3) (1997)
Khee Meng Koh, Kee L. Teo
The search for chromatically unique graphs - II. Discret. Math. 172 (1-3) (1997)
C. C. Chen, G. L. Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo
Preface. Discret. Math. 172 (1-3) (1997)
Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang
Chromatic equivalence classes of certain generalized polygon trees. Discret. Math. 172 (1-3) (1997)
Hong Wang, Charles H. C. Little, Kee L. Teo
Partition of a directed bipartite graph into two directed cycles. Discret. Math. 160 (1-3) (1996)
Khee Meng Koh, Kee L. Teo
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discret. Math. 127 (1-3) (1994)
Khee Meng Koh, Kee L. Teo
The search for chromatically unique graphs. Graphs Comb. 6 (3) (1990)
Khee Meng Koh, Kee L. Teo
The 2-hamiltonian cubes of graphs. J. Graph Theory 13 (6) (1989)