Kee L. Teo

22 papers Journal 22
YearRankTypeTitle / Venue / Authors
2009 J jnl
A new expression for the adjoint polynomial of a path.
Australas. J Comb.
Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu
2004 J jnl
A new proof of a characterisation of Pfaffian bipartite graphs.
J. Comb. Theory B
Serguei Norine, Charles H. C. Little, Kee L. Teo
2004 J jnl
Chromatically Unique Multibridge Graphs.
Electron. J. Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
2004 J jnl
Graph-functions associated with an edge-property.
Australas. J Comb.
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2002 J jnl
A note on the chromaticity of some 2-connected (n, n+3)-graphs.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Khee Meng Koh
2002 J jnl
Chromaticity of some families of dense graphs.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002 J jnl
Non-chordal graphs having integral-root chromatic polynomials II.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
2002 J jnl
The vertex-cover polynomial of a graph.
Discret. Math.
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2002 J jnl
Two invariants for adjointly equivalent graphs.
Australas. J Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002 J jnl
Zeros of adjoint polynomials of paths and cycles.
Australas. J Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2001 J jnl
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
J. Graph Theory
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
2001 J jnl
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs.
Graphs Comb.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo
2000 J jnl
An attempt to classify bipartite graphs by chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000 J jnl
Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
1997 J jnl
Chromatic equivalence classes of certain generalized polygon trees.
Discret. Math.
Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang
1997 J jnl
On a Conjecture on Directed Cycles in a Directed Bipartite Graph.
Graphs Comb.
Charles H. C. Little, Kee L. Teo, Hong Wang
1997 J jnl
Preface.
Discret. Math.
C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo
1997 J jnl
The search for chromatically unique graphs - II.
Discret. Math.
Khee Meng Koh, Kee L. Teo
1996 J jnl
Partition of a directed bipartite graph into two directed cycles.
Discret. Math.
Hong Wang, Charles H. C. Little, Kee L. Teo
1994 J jnl
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles.
Discret. Math.
Khee Meng Koh, Kee L. Teo
1990 J jnl
The search for chromatically unique graphs.
Graphs Comb.
Khee Meng Koh, Kee L. Teo
1989 J jnl
The 2-hamiltonian cubes of graphs.
J. Graph Theory
Khee Meng Koh, Kee L. Teo