Peter Che Bor Lam

According to our database, Peter Che Bor Lam authored at least 39 papers between 1995 and 2014.

Collaborative distances:

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

2014

Notes on L(1, 1) and L(2, 1) labelings for n-cube.

Haiying Zhou, Wai Chee Shiu, Peter Che Bor Lam

J. Comb. Optim., 2014

Characterization of 3-Regular Halin Graphs with Edge-face Total Chromatic Number Equal to Four.

Wai Hong Chan, Peter C. B. Lam, Wai-Chee Shiu

Ars Comb., 2014

2010

On time-relaxed broadcasting networks.

Tianxing Yao, Peter Che Bor Lam, Wensong Lin, Guofei Zhou

Discret. Appl. Math., 2010

2009

Edge-Face Total Chromatic Number of Halin Graphs.

Wai Hong Chan, Peter Che Bor Lam, Wai Chee Shiu

SIAM J. Discret. Math., 2009

Collapsible graphs and reductions of line graphs.

Zhi-Hong Chen, Peter C. B. Lam, Wai-Chee Shiu

Discret. Math., 2009

2008

Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems.

Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu

SIAM J. Discret. Math., 2008

Distance two labelling and direct products of graphs.

Wensong Lin, Peter Che Bor Lam

Discret. Math., 2008

Cyclic bandwidth with an edge added.

Wai Hong Chan, Peter Che Bor Lam, Wai Chee Shiu

Discret. Appl. Math., 2008

On Irreducibility of Maximal Cliques.

Tao-Ming Wang, Peter Che Bor Lam, Jun-Lin Kuo, Feng-Rung Hu

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

L(2, 1)-labellings of integer distance graphs.

Peter Che Bor Lam, Tao-Ming Wang, Guohua Gu

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

<i>L</i> ( <i>j</i> , <i>k</i> )- and circular <i>L</i> ( <i>j</i> , <i>k</i> )-labellings for the products of complete graphs.

Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu

J. Comb. Optim., 2007

2006

Several parameters of generalized Mycielskians.

Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu

Discret. Appl. Math., 2006

Bounds On The Labelling Numbers Of Chordal Graphs.

Peter Che Bor Lam, Guohua Gu, Wensong Lin, Ping-Tsai Chung

Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005

Coloring of distance graphs with intervals as distance sets.

Peter Che Bor Lam, Wensong Lin

Eur. J. Comb., 2005

Circular chromatic numbers of some distance graphs.

Wensong Lin, Peter Che Bor Lam, Zengmin Song

Discret. Math., 2005

The 3-choosability of plane graphs of girth 4.

Peter Che Bor Lam, Wai Chee Shiu, Zengmin Song

Discret. Math., 2005

2004

Some remarks on domination.

Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster

J. Graph Theory, 2004

2003

A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph.

Peter Che Bor Lam, Heping Zhang

Order, 2003

Circular chromatic number and a generalization of the construction of Mycielski.

Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song

J. Comb. Theory, Ser. B, 2003

On Some Three-Color Ramsey Numbers.

Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li

Graphs Comb., 2003

Cell rotation graphs of strongly connected orientations of plane graphs with an application.

Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu

Discret. Appl. Math., 2003

2002

Edge-magic Indices of (n, n - 1)-graphs.

Wai Chee Shiu, Peter C. B. Lam, Sin-Min Lee

Electron. Notes Discret. Math., 2002

On generalized Ramsey numbers.

Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li

Discret. Math., 2002

On incidence coloring for some cubic graphs.

Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen

Discret. Math., 2002

Edge-gracefulness of the composition of paths with null graphs.

Wai Chee Shiu, Peter Che Bor Lam, Hee Lin Cheng

Discret. Math., 2002

Characterization of graphs with equal bandwidth and cyclic bandwidth.

Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan

Discret. Math., 2002

On Wiener numbers of polygonal nets.

Wai Chee Shiu, Peter Che Bor Lam, Kin Keung Poon

Discret. Appl. Math., 2002

2001

On Structure of Some Plane Graphs with Application to Choosability.

Peter Che Bor Lam, Wai Chee Shiu, Baogang Xu

J. Comb. Theory, Ser. B, 2001

On the equitable chromatic number of complete n-partite graphs.

Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang

Discret. Appl. Math., 2001

Linear Vertex Arboricity, Independence Number and Clique Cover Number.

Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan

Ars Comb., 2001

2000

Orthogonal (g, f)-factorizations in networks.

Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu

Networks, 2000

1999

The 4-Choosability of Plane Graphs without 4-Cycles'.

Peter Che Bor Lam, Baogang Xu, Jiazhuang Liu

J. Comb. Theory, Ser. B, 1999

On independent domination number of regular graphs.

Peter Che Bor Lam, Wai Chee Shiu, Liang Sun

Discret. Math., 1999

1997

The vertex-face total chromatic number of Halin graphs.

Peter Che Bor Lam, Zhongfu Zhang

Networks, 1997

On the bandwidth of convex triangulation meshes.

Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan, Y. Lin

Discret. Math., 1997

Wiener Number of Hexagonal Jagged-rectangles.

Wai Chee Shiu, Chong Sze Tong, Peter Che Bor Lam

Discret. Appl. Math., 1997

The Wiener Number of the Hexagonal Net.

Wai Chee Shiu, Peter Che Bor Lam

Discret. Appl. Math., 1997

On Bandwidth and Cyclic Bandwidth of Graphs.

Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan

Ars Comb., 1997

1995

Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6.

C. F. Chang, J. X. Chang, X. C. Lu, Peter Che Bor Lam, J. F. Wang

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995