Wensong Lin

56 papers Journal 55Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Packing 2- and 3-stars into (2,3)-regular graphs.
Discret. Appl. Math.
Wenying Xi, Wensong Lin, Yuquan Lin
2025 J jnl
Semistrong edge colorings of planar graphs.
J. Comb. Optim.
Yuquan Lin, Wensong Lin
2024 J jnl
Fashion game on graphs with more than two actions.
J. Comb. Optim.
Qi Wang, Wensong Lin
2024 J jnl
Packing 2- and 3-stars into cubic graphs.
Appl. Math. Comput.
Wenying Xi, Wensong Lin, Yuquan Lin
2024 J jnl
Strong chromatic index of claw-free graphs with edge weight seven.
Discuss. Math. Graph Theory
Yuquan Lin, Wensong Lin
2024 J jnl
The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its Vertices.
Graphs Comb.
Wenying Xi, Wensong Lin
2024 J jnl
The maximum 3-star packing problem in claw-free cubic graphs.
J. Comb. Optim.
Wenying Xi, Wensong Lin
2023 J jnl
Maximum weight
RAIRO Oper. Res.
Yuquan Lin, Wensong Lin
2023 J jnl
The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs.
Graphs Comb.
Yuquan Lin, Wensong Lin
2022 J jnl
Fashion Game on Planar Graphs.
Graphs Comb.
Chenli Shen, Wensong Lin
2022 J jnl
Some Results on the Erdős-Faber-Lovász Conjecture.
Symmetry
Yun Feng, Wensong Lin
2021 J jnl
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities.
Int. J. Found. Comput. Sci.
Chenli Shen, Wensong Lin
2021 J jnl
On maximum P
J. Comb. Optim.
Wenying Xi, Wensong Lin
2021 J jnl
On star family packing of graphs.
RAIRO Oper. Res.
Mengya Li, Wensong Lin
2020 J jnl
Channel assignment problem and relaxed 2-distant coloring of graphs.
Discret. Appl. Math.
Wensong Lin
2020 J jnl
Fashion game on graphs.
Discret. Optim.
Chenli Shen, Wensong Lin
2018 J jnl
Channel assignment problem and n-fold t-separated L(j
J. Comb. Optim.
Wensong Lin, Chenli Shen
2018 J jnl
On t-relaxed chromatic number of r-power paths.
Discret. Math. Algorithms Appl.
Jun Lan, Wensong Lin
2017 J jnl
On (s, t)-relaxed L(1, 1)-labelling of trees.
Int. J. Comput. Math.
Wensong Lin, Xuan Zhao
2017 J jnl
On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice.
Ars Comb.
Benqiu Dai, Wensong Lin
2017 J jnl
On (s, t)-relaxed strong edge-coloring of graphs.
J. Comb. Optim.
Dan He, Wensong Lin
2017 J jnl
On 2-distance coloring of plane graphs with girth 5.
Discret. Appl. Math.
Wei Dong, Wensong Lin
2016 J jnl
An improved bound on 2-distance coloring plane graphs with girth 5.
J. Comb. Optim.
Wei Dong, Wensong Lin
2016 J jnl
On (s, t)-relaxed L(2, 1)-labeling of graphs.
J. Comb. Optim.
Wensong Lin
2016 J jnl
On the equitable vertex arboricity of graphs.
Int. J. Comput. Math.
Fangyun Tao, Wensong Lin
2015 J jnl
L(j, k)-labelings of Cartesian products of three complete graphs.
Ars Comb.
Damei Lv, Wensong Lin
2015 J jnl
On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice.
J. Comb. Optim.
Wensong Lin, Benqiu Dai
2015 J jnl
On circular-
Int. J. Comput. Math.
Yan Sun, Wensong Lin
2014 J jnl
Entire coloring of plane graph with maximum degree eleven.
Discret. Math.
Wei Dong, Wensong Lin
2014 J jnl
Injective coloring of plane graphs with girth 5.
Discret. Math.
Wei Dong, Wensong Lin
2014 J jnl
Multiple L(j, 1)-labeling of the triangular lattice.
J. Comb. Optim.
Pu Zhang, Wensong Lin
2014 J jnl
On linear coloring of planar graphs with small girth.
Discret. Appl. Math.
Wei Dong, Wensong Lin
2013 J jnl
A concise proof for total coloring subcubic graphs.
Inf. Process. Lett.
Yun Feng, Wensong Lin
2013 J jnl
Distance two edge labelings of lattices.
J. Comb. Optim.
Wensong Lin, Jianzhuan Wu
2013 J jnl
Injective coloring of planar graphs with girth 6.
Discret. Math.
Wei Dong, Wensong Lin
2013 J jnl
On (
Inf. Process. Lett.
Benqiu Dai, Wensong Lin
2012 J jnl
A proof of a conjecture on multiset coloring the powers of cycles.
Inf. Process. Lett.
Yun Feng, Wensong Lin
2012 J jnl
Distance two labelings of Cartesian products of complete graphs.
Ars Comb.
Damei Lu, Wensong Lin, Zengmin Song
2012 J jnl
Group path covering and L(j, k)-labelings of diameter two graphs.
Inf. Process. Lett.
Feng Wang, Wensong Lin
2012 J jnl
L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs.
Ars Comb.
Qin Chen, Wensong Lin
2012 J jnl
On n-fold L(j, k)-and circular L(j, k)-labelings of graphs.
Discret. Appl. Math.
Wensong Lin, Pu Zhang
2011 J jnl
Group path covering and distance two labeling of graphs.
Inf. Process. Lett.
Feng Wang, Wensong Lin
2010 J jnl
Multi-coloring the Mycielskian of graphs.
J. Graph Theory
Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu
2010 J jnl
On time-relaxed broadcasting networks.
Discret. Appl. Math.
Tianxing Yao, Peter Che Bor Lam, Wensong Lin, Guofei Zhou
2009 J jnl
Circular game chromatic number of graphs.
Discret. Math.
Wensong Lin, Xuding Zhu
2008 J jnl
Distance two labelling and direct products of graphs.
Discret. Math.
Wensong Lin, Peter Che Bor Lam
2008 J jnl
Multicoloring and Mycielski construction.
Discret. Math.
Wensong Lin
2008 J jnl
The strong chromatic index of a class of graphs.
Discret. Math.
Jianzhuan Wu, Wensong Lin
2006 — conf
Bounds On The Labelling Numbers Of Chordal Graphs.
FCS
Peter Che Bor Lam, Guohua Gu, Wensong Lin, Ping-Tsai Chung
2006 J jnl
Several parameters of generalized Mycielskians.
Discret. Appl. Math.
Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu
2005 J jnl
Circular chromatic numbers of some distance graphs.
Discret. Math.
Wensong Lin, Peter Che Bor Lam, Zengmin Song
2005 J jnl
Coloring of distance graphs with intervals as distance sets.
Eur. J. Comb.
Peter Che Bor Lam, Wensong Lin
2004 J jnl
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval.
Ars Comb.
Jianzhuan Wu, Wensong Lin
2003 J jnl
Circular chromatic number and a generalization of the construction of Mycielski.
J. Comb. Theory B
Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song
2003 J jnl
Some star extremal circulant graphs.
Discret. Math.
Wensong Lin
2001 J jnl
Neighborhood Union Condition with Distance for Vertex-pancyclicity.
Ars Comb.
Wensong Lin, Zengmin Song