Wensong Lin

From MaRDI portal
Person:247868

Available identifiers

zbMath Open lin.wensongMaRDI QIDQ247868

List of research outcomes

PublicationDate of PublicationType
The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices2024-01-29Paper
Maximum weight t-sparse set problem on vector-weighted graphs2024-01-22Paper
Proving a conjecture on the upper bound of semistrong chromatic indices of graphs2023-10-19Paper
Packing 2- and 3-stars into cubic graphs2023-10-11Paper
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities2023-08-15Paper
https://portal.mardi4nfdi.de/entity/Q61677472023-08-07Paper
The tight bound for the strong chromatic indices of claw-free subcubic graphs2023-07-12Paper
Fashion game on planar graphs2022-05-23Paper
On \(t\)-relaxed 2-distant circular coloring of graphs2021-08-12Paper
On star family packing of graphs2021-07-21Paper
On t-relaxed coloring of complete multi-partite graphs2021-06-14Paper
On maximum \(P_3\)-packing in claw-free subcubic graphs2021-05-11Paper
Fashion game on graphs2021-01-15Paper
https://portal.mardi4nfdi.de/entity/Q32971542020-07-02Paper
Channel assignment problem and relaxed 2-distant coloring of graphs2020-03-23Paper
https://portal.mardi4nfdi.de/entity/Q52063732019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52440192019-11-19Paper
https://portal.mardi4nfdi.de/entity/Q46407602018-05-25Paper
Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs2018-05-24Paper
On t-relaxed chromatic number of r-power paths2018-04-10Paper
https://portal.mardi4nfdi.de/entity/Q53550542017-09-06Paper
On 2-distance coloring of plane graphs with girth 52017-03-15Paper
On \((s,t)\)-relaxed strong edge-coloring of graphs2017-02-22Paper
On multiset colorings of generalized corona graphs2017-01-13Paper
An improved bound on 2-distance coloring plane graphs with girth 52016-08-31Paper
https://portal.mardi4nfdi.de/entity/Q57407852016-07-20Paper
On the equitable vertex arboricity of graphs2016-07-19Paper
https://portal.mardi4nfdi.de/entity/Q28047842016-05-04Paper
On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs2016-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31938002015-10-28Paper
On circular-L(2, 1)-labellings of products of graphs2015-06-24Paper
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice2015-05-11Paper
\(L(1, 2)\)-edge-labelings for lattices2015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54980792015-02-11Paper
Entire coloring of plane graph with maximum degree eleven2014-09-04Paper
On linear coloring of planar graphs with small girth2014-08-22Paper
https://portal.mardi4nfdi.de/entity/Q51661582014-06-30Paper
Multiple \(L(j,1)\)-labeling of the triangular lattice2014-06-24Paper
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice2014-04-14Paper
A concise proof for total coloring subcubic graphs2014-04-11Paper
Injective coloring of planar graphs with girth 62014-01-20Paper
Injective coloring of plane graphs with girth 52014-01-16Paper
https://portal.mardi4nfdi.de/entity/Q28466332013-09-09Paper
Distance two edge labelings of lattices2013-06-13Paper
Group path covering and distance two labeling of graphs2013-04-04Paper
https://portal.mardi4nfdi.de/entity/Q49096792013-03-21Paper
On circular-\(L\)(2,1)-edge-labeling of graphs2013-02-21Paper
A proof of a conjecture on multiset coloring the powers of cycles2012-10-23Paper
On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs2012-10-19Paper
Group path covering and \(L(j,k)\)-labelings of diameter two graphs2012-05-04Paper
https://portal.mardi4nfdi.de/entity/Q30525992010-11-05Paper
On time-relaxed broadcasting networks2010-10-11Paper
https://portal.mardi4nfdi.de/entity/Q35746682010-07-09Paper
https://portal.mardi4nfdi.de/entity/Q35724312010-07-08Paper
Multi-coloring the Mycielskian of graphs2010-04-22Paper
Circular game chromatic number of graphs2009-12-10Paper
https://portal.mardi4nfdi.de/entity/Q53202742009-07-22Paper
Star matching and distance two labelling2009-06-23Paper
The strong chromatic index of a class of graphs2009-01-28Paper
Circular consecutive choosability of graphs2008-09-29Paper
https://portal.mardi4nfdi.de/entity/Q35131632008-08-06Paper
Distance two labelling and direct products of graphs2008-07-11Paper
Multicoloring and Mycielski construction2008-07-11Paper
https://portal.mardi4nfdi.de/entity/Q35013452008-06-03Paper
\(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs2008-02-18Paper
https://portal.mardi4nfdi.de/entity/Q54350962008-01-14Paper
Several parameters of generalized Mycielskians2006-06-30Paper
https://portal.mardi4nfdi.de/entity/Q54755262006-06-26Paper
https://portal.mardi4nfdi.de/entity/Q54683872006-05-26Paper
Coloring of distance graphs with intervals as distance sets2005-09-29Paper
https://portal.mardi4nfdi.de/entity/Q54614572005-07-26Paper
Circular chromatic numbers of some distance graphs2005-04-28Paper
Circular chromatic number and a generalization of the construction of Mycielski.2004-01-06Paper
Some star extremal circulant graphs2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q45459612002-08-18Paper
https://portal.mardi4nfdi.de/entity/Q27159412001-05-30Paper
https://portal.mardi4nfdi.de/entity/Q43879031998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q48844971996-07-15Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Wensong Lin