default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWensong Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Wenying Xi, Wensong Lin
, Yuquan Lin:
Packing 2- and 3-stars into cubic graphs. Appl. Math. Comput. 460: 128287 (2024)- [j52]Yuquan Lin, Wensong Lin:
Strong chromatic index of claw-free graphs with edge weight seven. Discuss. Math. Graph Theory 44(4): 1311-1325 (2024) - [j51]Wenying Xi, Wensong Lin:
The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its Vertices. Graphs Comb. 40(1): 5 (2024) - [j50]Wenying Xi, Wensong Lin:
The maximum 3-star packing problem in claw-free cubic graphs. J. Comb. Optim. 47(5): 73 (2024) - 2023
- [j49]Yuquan Lin, Wensong Lin:
The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs. Graphs Comb. 39(3): 58 (2023) - [j48]Yuquan Lin, Wensong Lin:
Maximum weight t-sparse set problem on vector-weighted graphs. RAIRO Oper. Res. 57(5): 2799-2818 (2023) - 2022
- [j47]Chenli Shen, Wensong Lin:
Fashion Game on Planar Graphs. Graphs Comb. 38(3): 92 (2022) - [j46]Yun Feng, Wensong Lin:
Some Results on the Erdős-Faber-Lovász Conjecture. Symmetry 14(7): 1327 (2022) - 2021
- [j45]Chenli Shen, Wensong Lin:
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities. Int. J. Found. Comput. Sci. 32(8): 957-979 (2021) - [j44]Wenying Xi, Wensong Lin:
On maximum P3-packing in claw-free subcubic graphs. J. Comb. Optim. 41(3): 694-709 (2021) - [j43]Mengya Li, Wensong Lin:
On star family packing of graphs. RAIRO Oper. Res. 55(4): 2129-2140 (2021) - 2020
- [j42]Wensong Lin:
Channel assignment problem and relaxed 2-distant coloring of graphs. Discret. Appl. Math. 277: 231-244 (2020) - [j41]Chenli Shen, Wensong Lin:
Fashion game on graphs. Discret. Optim. 38: 100606 (2020)
2010 – 2019
- 2018
- [j40]Jun Lan, Wensong Lin:
On t-relaxed chromatic number of r-power paths. Discret. Math. Algorithms Appl. 10(2): 1850017:1-1850017:9 (2018) - [j39]Wensong Lin, Chenli Shen:
Channel assignment problem and n-fold t-separated L(j1, j2, ... , jm) -labeling of graphs. J. Comb. Optim. 35(4): 1147-1167 (2018) - 2017
- [j38]Benqiu Dai, Wensong Lin:
On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice. Ars Comb. 130: 319-331 (2017) - [j37]Wei Dong, Wensong Lin:
On 2-distance coloring of plane graphs with girth 5. Discret. Appl. Math. 217: 495-505 (2017) - [j36]Wensong Lin, Xuan Zhao:
On (s, t)-relaxed L(1, 1)-labelling of trees. Int. J. Comput. Math. 94(6): 1219-1227 (2017) - [j35]Dan He, Wensong Lin:
On (s, t)-relaxed strong edge-coloring of graphs. J. Comb. Optim. 33(2): 609-625 (2017) - 2016
- [j34]Fangyun Tao, Wensong Lin:
On the equitable vertex arboricity of graphs. Int. J. Comput. Math. 93(6): 844-853 (2016) - [j33]Wensong Lin:
On (s, t)-relaxed L(2, 1)-labeling of graphs. J. Comb. Optim. 31(1): 405-426 (2016) - [j32]Wei Dong, Wensong Lin:
An improved bound on 2-distance coloring plane graphs with girth 5. J. Comb. Optim. 32(2): 645-655 (2016) - 2015
- [j31]Damei Lv, Wensong Lin:
L(j, k)-labelings of Cartesian products of three complete graphs. Ars Comb. 119: 97-116 (2015) - [j30]Yan Sun, Wensong Lin:
On circular-L(2, 1)-labellings of products of graphs. Int. J. Comput. Math. 92(3): 441-450 (2015) - [j29]Wensong Lin, Benqiu Dai:
On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice. J. Comb. Optim. 29(3): 655-669 (2015) - 2014
- [j28]Wei Dong, Wensong Lin:
On linear coloring of planar graphs with small girth. Discret. Appl. Math. 173: 35-44 (2014) - [j27]Wei Dong, Wensong Lin:
Injective coloring of plane graphs with girth 5. Discret. Math. 315-316: 120-127 (2014) - [j26]Wei Dong, Wensong Lin:
Entire coloring of plane graph with maximum degree eleven. Discret. Math. 336: 46-56 (2014) - [j25]Pu Zhang, Wensong Lin:
Multiple L(j, 1)-labeling of the triangular lattice. J. Comb. Optim. 27(4): 695-710 (2014) - 2013
- [j24]Wei Dong, Wensong Lin:
Injective coloring of planar graphs with girth 6. Discret. Math. 313(11): 1302-1311 (2013) - [j23]Yun Feng, Wensong Lin:
A concise proof for total coloring subcubic graphs. Inf. Process. Lett. 113(18): 664-665 (2013) - [j22]Benqiu Dai, Wensong Lin:
On (s, t)(s, t)-relaxed L(2, 1)L(2, 1)-labelings of the square lattice. Inf. Process. Lett. 113(19-21): 704-709 (2013) - [j21]Wensong Lin, Jianzhuan Wu:
Distance two edge labelings of lattices. J. Comb. Optim. 25(4): 661-679 (2013) - 2012
- [j20]Damei Lu, Wensong Lin, Zengmin Song:
Distance two labelings of Cartesian products of complete graphs. Ars Comb. 104: 33-40 (2012) - [j19]Qin Chen, Wensong Lin:
L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs. Ars Comb. 106: 161-172 (2012) - [j18]Wensong Lin, Pu Zhang:
On n-fold L(j, k)-and circular L(j, k)-labelings of graphs. Discret. Appl. Math. 160(16-17): 2452-2461 (2012) - [j17]Feng Wang, Wensong Lin:
Group path covering and L(j, k)-labelings of diameter two graphs. Inf. Process. Lett. 112(4): 124-128 (2012) - [j16]Yun Feng, Wensong Lin:
A proof of a conjecture on multiset coloring the powers of cycles. Inf. Process. Lett. 112(17-18): 678-682 (2012) - 2011
- [j15]Feng Wang, Wensong Lin:
Group path covering and distance two labeling of graphs. Inf. Process. Lett. 111(13): 621-625 (2011) - 2010
- [j14]Tianxing Yao, Peter Che Bor Lam, Wensong Lin, Guofei Zhou:
On time-relaxed broadcasting networks. Discret. Appl. Math. 158(9): 1029-1034 (2010) - [j13]Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. J. Graph Theory 63(4): 311-323 (2010)
2000 – 2009
- 2009
- [j12]Wensong Lin, Xuding Zhu:
Circular game chromatic number of graphs. Discret. Math. 309(13): 4495-4501 (2009) - 2008
- [j11]Wensong Lin:
Multicoloring and Mycielski construction. Discret. Math. 308(16): 3565-3573 (2008) - [j10]Wensong Lin, Peter Che Bor Lam:
Distance two labelling and direct products of graphs. Discret. Math. 308(17): 3805-3815 (2008) - [j9]Jianzhuan Wu, Wensong Lin:
The strong chromatic index of a class of graphs. Discret. Math. 308(24): 6254-6261 (2008) - 2007
- [j8]Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu:
L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. J. Comb. Optim. 14(2-3): 219-227 (2007) - 2006
- [j7]Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu:
Several parameters of generalized Mycielskians. Discret. Appl. Math. 154(8): 1173-1182 (2006) - [c1]Peter Che Bor Lam, Guohua Gu, Wensong Lin, Ping-Tsai Chung:
Bounds On The Labelling Numbers Of Chordal Graphs. FCS 2006: 41-47 - 2005
- [j6]Wensong Lin, Peter Che Bor Lam, Zengmin Song:
Circular chromatic numbers of some distance graphs. Discret. Math. 292(1-3): 119-130 (2005) - [j5]Peter Che Bor Lam, Wensong Lin:
Coloring of distance graphs with intervals as distance sets. Eur. J. Comb. 26(8): 1216-1229 (2005) - 2004
- [j4]Jianzhuan Wu, Wensong Lin:
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval. Ars Comb. 70 (2004) - 2003
- [j3]Wensong Lin:
Some star extremal circulant graphs. Discret. Math. 271(1-3): 169-177 (2003) - [j2]Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song:
Circular chromatic number and a generalization of the construction of Mycielski. J. Comb. Theory B 89(2): 195-205 (2003) - 2001
- [j1]Wensong Lin, Zengmin Song:
Neighborhood Union Condition with Distance for Vertex-pancyclicity. Ars Comb. 61 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
