Neighborhood Union Condition with Distance for Vertex-pancyclicity. - Wensong Lin; Zengmin Song (Ars Comb., 2001)

Some star extremal circulant graphs. - Wensong Lin (Discret. Math., 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 B, 2003)

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval. - Jianzhuan Wu; Wensong Lin (Ars Comb., 2004)

Circular chromatic numbers of some distance graphs. - Wensong Lin; Peter Che Bor Lam; Zengmin Song (Discret. Math., 2005)

Coloring of distance graphs with intervals as distance sets. - Peter Che Bor Lam; Wensong Lin (Eur. J. Comb., 2005)

Bounds On The Labelling Numbers Of Chordal Graphs. - Peter Che Bor Lam; Guohua Gu; Wensong Lin; Ping-Tsai Chung (FCS, 2006)

Several parameters of generalized Mycielskians. - Wensong Lin; Jianzhuan Wu; Peter Che Bor Lam; Guohua Gu (Discret. Appl. Math., 2006)

L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. - Peter Che Bor Lam; Wensong Lin; Jianzhuan Wu (J. Comb. Optim., 2007)

Multicoloring and Mycielski construction. - Wensong Lin (Discret. Math., 2008)

Distance two labelling and direct products of graphs. - Wensong Lin; Peter Che Bor Lam (Discret. Math., 2008)

The strong chromatic index of a class of graphs. - Jianzhuan Wu; Wensong Lin (Discret. Math., 2008)

Circular game chromatic number of graphs. - Wensong Lin; Xuding Zhu (Discret. Math., 2009)

On time-relaxed broadcasting networks. - Tianxing Yao; Peter Che Bor Lam; Wensong Lin; Guofei Zhou (Discret. Appl. Math., 2010)

Multi-coloring the Mycielskian of graphs. - Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu (J. Graph Theory, 2010)

Group path covering and distance two labeling of graphs. - Feng Wang; Wensong Lin (Inf. Process. Lett., 2011)

L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs. - Qin Chen; Wensong Lin (Ars Comb., 2012)

Distance two labelings of Cartesian products of complete graphs. - Damei Lu; Wensong Lin; Zengmin Song (Ars Comb., 2012)

On n-fold L(j, k)-and circular L(j, k)-labelings of graphs. - Wensong Lin; Pu Zhang (Discret. Appl. Math., 2012)

A proof of a conjecture on multiset coloring the powers of cycles. - Yun Feng; Wensong Lin (Inf. Process. Lett., 2012)

Group path covering and L(j, k)-labelings of diameter two graphs. - Feng Wang; Wensong Lin (Inf. Process. Lett., 2012)

Injective coloring of planar graphs with girth 6. - Wei Dong; Wensong Lin (Discret. Math., 2013)

On (s, t)(s, t)-relaxed L(2, 1)L(2, 1)-labelings of the square lattice. - Benqiu Dai; Wensong Lin (Inf. Process. Lett., 2013)

A concise proof for total coloring subcubic graphs. - Yun Feng; Wensong Lin (Inf. Process. Lett., 2013)

Distance two edge labelings of lattices. - Wensong Lin; Jianzhuan Wu (J. Comb. Optim., 2013)

On linear coloring of planar graphs with small girth. - Wei Dong; Wensong Lin (Discret. Appl. Math., 2014)

Injective coloring of plane graphs with girth 5. - Wei Dong; Wensong Lin (Discret. Math., 2014)

Entire coloring of plane graph with maximum degree eleven. - Wei Dong; Wensong Lin (Discret. Math., 2014)

Multiple L(j, 1)-labeling of the triangular lattice. - Pu Zhang; Wensong Lin (J. Comb. Optim., 2014)

L(j, k)-labelings of Cartesian products of three complete graphs. - Damei Lv; Wensong Lin (Ars Comb., 2015)

On circular-L(2, 1)-labellings of products of graphs. - Yan Sun; Wensong Lin (Int. J. Comput. Math., 2015)

On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice. - Wensong Lin; Benqiu Dai (J. Comb. Optim., 2015)

On the equitable vertex arboricity of graphs. - Fangyun Tao; Wensong Lin (Int. J. Comput. Math., 2016)

An improved bound on 2-distance coloring plane graphs with girth 5. - Wei Dong; Wensong Lin (J. Comb. Optim., 2016)

On (s, t)-relaxed L(2, 1)-labeling of graphs. - Wensong Lin (J. Comb. Optim., 2016)

On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice. - Benqiu Dai; Wensong Lin (Ars Comb., 2017)

On 2-distance coloring of plane graphs with girth 5. - Wei Dong; Wensong Lin (Discret. Appl. Math., 2017)

On (s, t)-relaxed L(1, 1)-labelling of trees. - Wensong Lin; Xuan Zhao 004 (Int. J. Comput. Math., 2017)

On (s, t)-relaxed strong edge-coloring of graphs. - Dan He; Wensong Lin (J. Comb. Optim., 2017)

On t-relaxed chromatic number of r-power paths. - Jun Lan; Wensong Lin (Discret. Math. Algorithms Appl., 2018)

Channel assignment problem and n-fold t-separated L(j1, j2, ... , jm) -labeling of graphs. - Wensong Lin; Chenli Shen (J. Comb. Optim., 2018)

Channel assignment problem and relaxed 2-distant coloring of graphs. - Wensong Lin (Discret. Appl. Math., 2020)

Fashion game on graphs. - Chenli Shen; Wensong Lin (Discret. Optim., 2020)

NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities. - Chenli Shen; Wensong Lin (Int. J. Found. Comput. Sci., 2021)

On maximum P3-packing in claw-free subcubic graphs. - Wenying Xi; Wensong Lin (J. Comb. Optim., 2021)

On star family packing of graphs. - Mengya Li; Wensong Lin (RAIRO Oper. Res., 2021)

Fashion Game on Planar Graphs. - Chenli Shen; Wensong Lin (Graphs Comb., 2022)

Some Results on the Erdős-Faber-Lovász Conjecture. - Yun Feng; Wensong Lin (Symmetry, 2022)

Maximum weight t-sparse set problem on vector-weighted graphs. - Yuquan Lin; Wensong Lin (RAIRO Oper. Res., 2023)

The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs. - Yuquan Lin; Wensong Lin (Graphs Comb., 2023)

Strong chromatic index of claw-free graphs with edge weight seven. - Yuquan Lin; Wensong Lin (Discuss. Math. Graph Theory, 2024)

Packing 2- and 3-stars into cubic graphs. - Wenying Xi; Wensong Lin; Yuquan Lin (Appl. Math. Comput., 2024)

The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its Vertices. - Wenying Xi; Wensong Lin (Graphs Comb., 2024)

The maximum 3-star packing problem in claw-free cubic graphs. - Wenying Xi; Wensong Lin (J. Comb. Optim., 2024)

Fashion game on graphs with more than two actions. - Qi Wang; Wensong Lin (J. Comb. Optim., 2024)

Packing 2- and 3-stars into (2,3)-regular graphs. - Wenying Xi; Wensong Lin; Yuquan Lin (Discret. Appl. Math., 2025)