On a construction of critical graphs which are not sensitive. - Khee Meng Koh; K. S. Poh (Graphs Comb., 1985)

On the uniformity of the closed-set lattice of a tree. - Khee Meng Koh; K. S. Poh (Discret. Math., 1986)

Products of graphs with their closed-set lattices. - Khee Meng Koh; K. S. Poh (Discret. Math., 1988)

Constructions of sensitive graphs which are not strongly sensitive. - Khee Meng Koh; K. S. Poh (Discret. Math., 1988)

On the linear vertex-arboricity of a planar graph. - K. S. Poh (J. Graph Theory, 1990)

On the spectrum of the closed-set lattice of a graph. - Khee Meng Koh; K. S. Poh (Australas. J Comb., 1992)

On the lower length of the closed-set lattice of a tree. - Khee Meng Koh; K. S. Poh (Discret. Math., 1996)