头像
林文松
教授
数学学院
系统科学系
电话:
邮箱:
wslin@seu.edu.cn
地址:
图书馆545
邮编:
211189
  • 林文松,教授,博士生导师。1968年生。1986至1993年就读于山东大学数学系运筹学专业,获理学学士学位和理学硕士学位。2001至2004年就读于香港浸会大学数学系,获博士学位。1993年至今在东南大学数学系任教。 长期从事运筹学方面的教学和科研工作。先后主讲的本科生和研究生的课程有:图论及其应用、组合最优化、最优化理论与方法,离散数学、组合数学、运筹学、代数图论、随机图、现代图论等。主要研究方向:图论及其应用、组合最优化等。先后主持完成国家自然科学基金面上项目2项,主持江苏省自然科学基金面上项目1项。已在J. of Graph Theory,J. of Combin. Theory Ser. B., European J. Combin., Discrete Appl. Math.,Discrete Math., J. of Combin. Optim.,Inf. Proc. Lett.,Tanwanese J. of Math.,Inter. J. of Computer Math., Ars Combin.等刊物发表论文五十余篇。
  • 1.Wensong Lin* and Xuan Zhao, On (s, t)-relaxed L(1, 1)-labeling of trees, International Journal of Computer Mathematics, 94(6) (2017) 1219-1227.

    2.Dan He and Wensong Lin*, On (s,t)-relaxed strong edge-coloring of graphs, Journal of Combinatorial Optimization 33(2) (2017) 609-625.

    3.Benqiu Dai and Wensong Lin*, On (s,t)-relaxed L(2,1)-labelings of the hexagonal lattice, Ars Combinatoria 130 (2017) 319-331.

    4.Wei Dong* and Wensong Lin, On 2-distance coloring of plane graphs with girth 5, Discrete Applied Mathematics 217 (2017) 495-505.

    5.Fangyun Tao and Wensong Lin*, On the equitable vertex arboricity of graphs, International Journal of Computer Mathematics, 93(6) (2016) 844-853.

    6.Wei Dong* and Wensong Lin, An improved bound on 2-distance coloring plane graphs with girth 5, Journal of Combinatorial Optimization 32(2) (2016) 645-655.

    7.Yun Feng* and Wensong Lin, On the neighbor sum-distinguishing vertex coloring of a graph, Journal of combinatorial mathematics and combinatorial computing 96 (2016) 171-194.

    8.Wensong Lin*, On (s,t)-relaxed L(2,1)-labeling of graphs, Journal of Combinatorial Optimization, 31(1) (2016), 405-426.

    9.Damei Lv * and Wensong Lin, L(j,k)-labelings of Cartesian products of three complete graphs, Ars Combinatoria 119 (2015) 97-116.

    10.Wensong Lin* and Benqiu Dai, On (s,t)-relaxed L(2,1)-labelings of the triangular lattice, Journal of Combinatorial Optimization 29(3) (2015), 655-669.

    11.Yan Sun and Wensong Lin*, On circular L(2,1)-labelings of products of graphs, International Journal of Computer Mathematics 92(3) (2015), 441- 450.

    12. Dan He* and Wensong Lin, On L(1,2)-edge-labelings of some special classes of graphs. J. Math. Res. Appl. 34(4) (2014) 403–413.  (国内核心)

    13.Fangyun Tao* and Wensong Lin, On k-star arboricity of graphs, Journal of Donghua University (English Edition) 31(3) (2014), 335-338.

    14.Wei Dong* and Wensong Lin,Entire coloring of plane graph with maximum degree eleven, Discrete Mathematics 336 (2014), 46-56.

    15.Benqiu Dai and Wensong Lin*, On (s, t)-relaxed L(2,1)-labelings of the square lattice, Information Processing Letters 113(19-21) (2013), 704-709.

    16.Wei Dong* and Wensong Lin, Injective coloring of plane graphs with girth 5, Discrete Mathematics 315-316 (2014), 120-127. 

    17.Wei Dong* and Wensong Lin, On linear coloring of planar graphs with small girth, Discrete Applied Mathematics 173 (2014), 35-44.

    18.Pu Zhang and Wensong Lin*, Multiple L(j,1)-labeling of the triangular lattice, Journal of Combinatorial Optimization 27(4) (2014), 695-710.

    19.Dan He* and Wensong Lin, L(1,2)-edge-labelings for lattices. Appl. Math. J. Chinese Univ. Ser. B 29(2) (2014), 230–240. 

    20.Yun Feng* and Wensong Lin, Adjacent vertex-distinguishing total colorings of , Journal of Southeast University (English Edition) 29(2) (2013), 226-228.

    21.Fangyun Tao and Wensong Lin*, Linear arboricity of Cartesian products of graphs, Journal of Southeast University (English Edition) 29(2) (2013), 222-225.

    22.Yun Feng and Wensong Lin*, A concise proof for total coloring subcubic graphs, Information Processing Letters 113(18) (2013), 664-665.

    23.Wensong Lin*and Jianzhuan Wu, Distance two edge labelings of lattices,Journal of Combinatorial Optimization25(4) (2013), 661-679.

    24.Wei Dong* and Wensong Lin, Injective coloring of planar graphs with girth 6, Discrete Mathematics 313(12) (2013), 1302-1311.  

    25.Wensong Lin* and Jianzhuan Wu, On circular-L(2,1)-edge-labeling of graphs, Taiwanese Journal of Mathematics 16(6) (2012), 2063-2075.  

    26.Wensong Lin* and Pu Zhang, On n-fold L(j,k)- and circular L(j, k)-labeling of graphs, Discrete Applied Mathematics 160 (16-17) (2012), 2452-2461.

    27.Yun Feng and Wensong Lin*, A proof of a conjecture on multiset coloring the powers of cyclesInformation Processing Letters 112 (17-18) (2012), 678-682.    

    28.Qin Chen and Wensong Lin*, L(j,k)-Labelings and L(j,k)-Edge-Labelings of Graphs, Ars Combinatoria 106 (2012), 161-172.

    29.Damei Lv, Wensong Lin* and Zengmin Song, Distance two labelings of Cartesian products of complete graphs, Ars Combinatoria 104 (2012), 33-40. 

    30.Feng Wang* and Wensong Lin, Group path covering and L(j,k)-labelings of diameter two graphs, Information Processing Letters 112 (4) (2012), 124-128.

    31.Feng Wang and Wensong Lin*, Group path covering and distance two labeling of graphs, Information Processing Letters 111(13) (2011), 621-625.   

    32.Tianxing Yao*, Peter Che Bor Lam, Wensong Lin, Guofei Zhou, On time-relaxed broadcasting networks, Discrete Applied Mathematics 158(9) (2010), 1029-1034 . 

    33.Wensong Lin*, D.D.F. Liu, and Xuding Zhu, Multi-Coloring the Mycielskian of Graphs,Journal of Graph Theory 63(4) (2010), 311-323.

    34.Qiong Wu and Wensong Lin*, Circular L(j,k)-labeling numbers of trees and products of graphs, Journal of Southeast University (English Edition) 26(1) (2010), 142-145.

    35.Wensong Lin* and Xuding Zhu, Circular game chromatic number of graphs, Discrete Mathematics 309 (2009), 4495- 4501.

    36.Benqiu Dai and Wensong Lin*, Real edge spans of distance two labelings of graphs, Journal of Southeast University (English Edition) 25(4) (2009), 557-562.

    37.Damei Lv*, Wensong Lin and Zengmin Song, L(2, 1)-Circular Labelings of Cartesian Products of Complete Graphs, Journal of Mathematical Research & Exposition 29(1) (2009), 91-98.

    38.Wensong Lin* and Peter Che Bor Lam, Star matching and distance two labeling, Taiwanese Journal of Mathematics 13(1) (2009), 211-224.

    39.Wensong Lin, Daqing Yang, C. Yang, and Xuding Zhu*, Circular consecutive choosability of graphs, Taiwanese Journal of Mathematics 12(4) (2008), 951-968.

    40.Jianzhuan Wu and Wensong Lin*, Some results on circular chromatic number of a graph, Journal of Southeast University (English Edition) 24(2) (2008), 253-256.

    41.Wensong Lin*, Multicoloring and Mycielski construction, Discrete Mathematics 308 (2008), 3565-3573.

    42.Wensong Lin* and Peter Che Bor Lam, Distance two labelling and direct products of graphs, Discrete Mathematics 308 (2008), 3805-3815.

    43.Jianzhuan Wu and Wensong Lin*, The strong chromatic index of a class of graphs, Discrete Mathematics 308 (2008), 6254-6261. 

    44.Qingjie Niu, Wensong Lin*, and Zengmin Song, L(s,t) edge spans of trees and product of two paths, Journal of Southeast University (English Edition) 23(4) (2007), 639-642.

    45.Peter Che Bor Lam*, Wensong Lin, and Jianzhuan Wu, L(j,k)-labellings and circular L(j,k)-labellings of products of complete graphs, Journal of Combinatorial Optimization 14 (2-3) (2007), 219-227.

    46.Peter Che Bor Lam*, Guohua Gu, Wensong Lin, and Ping-Tsai Chung, Bounds on the labelling numbers of chordal graphs. FCS 2006: 41-47

    47.Wensong Lin*, Jianzhuan Wu, Peter Che Bor Lam, and Guohua Gu, Several parameters of generalized Mycielskians, Discrete Applied Mathematics 154(8) (2006), 1173-1182.

    48.Wensong Lin*, Peter Che Bor Lam, and Wai Chee Shiu, Circular chromatic numbers of the generalized Mycielskians of cycles, Journal of Nanjing University, Mathematical Biquarterly 23(2) (2006), 232-241.

    49.Jianzhuan Wu, Wensong Lin*, and Zengmin Song, Neighborhood unions involving distances and panconnectivity, Journal of Nanjing University, Mathematical Biquarterly 23(1) (2006), 36-44.

    50.Peter Che Bor Lam* and Wensong Lin, Coloring of distance graphs with intervals as distance sets, European Journal of Combinatorics 26 (2005), 1216-1229.

    51.Wensong Lin*, Peter Che Bor Lam, and Zengmin Song, Circular chromatic numbers of some distance graphs, Discrete Mathematics 292 (2005) 119-130.

    52.Jianzhuan Wu and Wensong Lin*, Circular chromatic numbers and fractional chromatic numbers of distance graphs with distance sets missing an interval, Ars Combinatoria 70 (2004), 161-168 .

    53.Wensong Lin and Guohua Gu, A necessary and sufficient condition for a vertex-transitive graph to be star extremal, Journal of Southeast University (English Edition) 20 (3) (2004), 374-377.

    54.Peter Che Bor Lam*, Wensong Lin, Guohua Gu and Zengmin Song, Circular chromatic number and a generalization of the construction of Mycielski, Journal of Combinatorics. Theory Series B 89 (2003), 195-205.

    55.Wensong Lin*, Some star extremal circulant graphs, Discrete Mathematics 271 (2003), 169-177.

    56.Wensong Lin* and Zengmin Song, Neighborhood union condition with distance for vertex-pancyclicity, Ars Combinatoria 61 (2001), 119-127.

    57.Wensong Lin*, Guohua Gu, and Zengmin Song, Fan-type condition and panconnectivity, Journal of Southeast University (English Edition) 16 (1) (2000), 101-105.

    58. Wensong Lin* and Zengmin Song, Neighborhood unions and edge-pancyclicity, Ars Combinatoria 48 (1998), 81-86.

      




  • 1. 新的图着色问题研究(2002-2004(10171013), 参与。(国家自然科学基金面上项目)

      

    2. 大规模稀疏线性规划的投影主元算法(2000-2002(19971014), 参与。(国家自然科学基金面上项目)

      

    3. 分派理论方法与决策系统 (1995-1997),参与。(国家自然科学基金面上项目)

      

    4. 复杂网络的同步和动态特性研究(2006-2008)(60574043),参与。(国家自然科学基金面上项目)

      

    5. 图的圆着色和距离二标号问题(2007.1-2008.12)(10671033),主持。(国家自然科学基金面上项目)

      

    6. 图的距离二标号问题 (2010.1-2012.12)(10971025),主持。(国家自然科学基金面上项目)

      

    7. 图的距离标号与频道分配问题  (2015.7-2018.6(BK20151399),主持。(江苏省自然科学基金面上项目)


    8. 图的松弛染色问题 (2018.1-2021.12)(11771080 ) 主持。(国家自然科学基金面上项目)