S. K. Teo

According to our database, S. K. Teo authored at least 3 papers between 1985 and 1990.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1990

Packing two graphs of order<i>n</i> having total size at most 2<i>n</i> - 2.

S. K. Teo, H. P. Yap

Graphs Comb., 1990

1987

Two Theorems on Packings of Graphs.

S. K. Teo, H. P. Yap

Eur. J. Comb., 1987

1985

Packing a tree with a graph of the same size.

Peter J. Slater, S. K. Teo, H. P. Yap

J. Graph Theory, 1985