-
P.C.B. Lam, W.S. Lin and J. Z. Wu,
L (j, k)- and circular L (j, k)-labellings for the products of
complete graphs, to appear in J. of Combinatorial Optimization
(2007).
-
W. S. Lin, J. Z. Wu, P.C.B. Lam and G. H. Gu,
Several parameters of generalize Mycielskians, Discrete Applied
Mathematics 154, 1173-1182(2006).
-
P.C.B. Lam and W.S. Lin, Coloring of distance graphs with intervals
as distance sets, European Journal of Combinatorics, 26(8),
1216-1229(2005)
-
P.C.B. Lam, W.C.Shiu and Z.M. Song, The 3-choosability of plane
graphs of girth 4, Discrete Mathematics 294, 297-301(2005).
-
D. Archdeacon, J. Ellis-Monaghan, P.C.B. Lam and R.Yuster, Some
remarks on domination, J. of Graph Theory, 46, 207-210(2004).
-
P.C.B. Lam, W.S. Lin, G.H. Gu and Z.M. Song, Circular chromatic
number and a generalization of the construction of Mycielski, J. of
combin. Theory Ser. B, 89, 195-205 (2003).
-
H.P. Zhang, P.C. B. Lam and W.C.Shiu, Cell rotation graphs of
strongly connected orientations of graphs with an application,
Discrete Applied Mathematics, 130, 469-485 (2003).
-
P.C.B. Lam, W.C. Shiu and H.P. Zhang, Elementary blocks of plane
bipartite graphs, Comm. in Math. Comput. Chem. (MATCH), 49,
127-137(2003).
-
P.C.B. Lam, W.C. Shiu and B.G. Xu, On structure of some plane graphs
with application to choosability, J. of Combin. Theory Ser. B, 82,
285-296 (2001).
-
P.C.B. Lam, B. G. Xu and J. Z. Liu, The 4-choosability of plane
graphs without 4-cycles, J. of Combinatorial Theory Series B, 76,
117-126(1999).