Kee L. Teo

发表

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2001, J. Graph Theory.

Chromatically unique bipartite graphs with low 3-independent partition numbers

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

A new proof of a characterisation of Pfaffian bipartite graphs

Charles H. C. Little, Kee L. Teo, Serguei Norine, 2004, J. Comb. Theory, Ser. B.

On a Conjecture on Directed Cycles in a Directed Bipartite Graph

Hong Wang, Charles H. C. Little, Kee L. Teo, 1997, Graphs Comb..

Two invariants for adjointly equivalent graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

Chromaticity of some families of dense graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

Graph-functions associated with an edge-property

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2004, Australas. J Comb..

Chromatically Unique Multibridge Graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2004, Electron. J. Comb..

Elements of Logic

Charles H. C. Little, Kee L. Teo, B van Brunt, 2003 .

The vertex-cover polynomial of a graph

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

Chromatic equivalence classes of certain generalized polygon trees

Hong Wang, Charles H. C. Little, Kee L. Teo, 1997, Discret. Math..

The search for chromatically unique graphs

Kee L. Teo, K. M. Koh, K. Koh, 1990, Graphs Comb..

The 2-hamiltonian cubes of graphs

Kee L. Teo, K. M. Koh, 1989, J. Graph Theory.

Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles

Kee L. Teo, K. M. Koh, K. Koh, 1994, Discret. Math..

Zeros of adjoint polynomials of paths and cycles

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

A new expression for the adjoint polynomial of a path

Jianfeng Wang, Chengfu Ye, Kee L. Teo, 2009, Australas. J Comb..

The search for chromatically unique graphs - II

Kee L. Teo, K. M. Koh, K. Koh, 1997, Discret. Math..

Partition of a directed bipartite graph into two directed cycles

Hong Wang, Charles H. C. Little, Kee L. Teo, 1996, Discret. Math..

Non-chordal graphs having integral-root chromatic polynomials II

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2002, Discret. Math..

Preface

Khee Meng Koh, Kee L. Teo, G. L. Chia, 1997, Discret. Math..

A note on the chromaticity of some 2-connected (n, n+3)-graphs

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2002, Discret. Math..

An attempt to classify bipartite graphs by chromatic polynomials

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

The Real Number System

Charles H. C. Little, Kee L. Teo, B van Brunt, 2003 .

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2001, Graphs Comb..