Jianliang Wu

Professor

Visit:

Biography

本人现为山东大学教授、博士生导师。正式发表学术的论文有180余篇，连续主持和参与了国家级自然科学基金多项，参与并完成国家自然科学基金重点项目2项。主要研究方向:图理论及其算法, 复杂网络,知识图谱，图神经网络.图理论方面主要研究的是图的染色.

Mathematical Reviews   Web of Science

Education Background

• 1996-09-01-1999-06-25
  山东大学
  运筹学与控制论
• 1988-09-01-1991-07-01
  山东大学
  运筹学与控制论
• 1984-09-01-1988-07-01
  山东矿业学院
  应用数学
• 1981-09-01-1984-07-01
  宿松县程集中学

Work Experience

• 2003-03 — Now
  山东大学
  教授
• 1999-10 — 2003-02
  山东科技大学副院长 
  副教授
• 1994-08 — 1999-09
  山东矿业学院
  讲师
• 1991-08 — 1994-08
  山东矿业学院
  助教

Working-Papers

Publication

Research direction

1. 图的染色理论：主要研究平面图以及相关图类的染色的理论问题。考虑图的点染色、无圈染色、边染色、全染色以及它们的列表情况等等。非常关注图的线性荫度猜想的研究进展。

2. 图的应用

Papers

(1)Jing, Fei. Quantifying and predicting evolutionary networks .Chaos, Solitons and Fractals .2025 ,191

(2)Sun, Lin. On list (p, 1)-total labellings of special planar graphs and 1-planar graphs .Journal of Combinatorial Optimization .2024 ,47 (3)

(3)张众. The Generation and Regulation of Public Opinion on Multiplex Social Networks .IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS .2024 :1-15

(4)谭香. THE LINEAR ARBORICITY OF GRAPHS WITH LOW TREEWIDTH .Discussiones Mathematicae Graph Theory .2024

(5)李亚昆. A Graphical Approach for Robust Set Stabilization of Boolean Control Networks with Lowest Time Complexity .IEEE Transactions on Network Science and Engineering .2025

(6)杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz .Discrete Mathematics .2023 ,346 (4)

(7)杨帆. <p>The total coloring of K-5-minor-free graphs</p> .European Journal of Combinatorics .2022 ,102

(8)冯洁茹. On generalized neighbor sum distinguishing index of planar graphs .DiscreteMathematicsAlgorithmsandApplications .2022 ,14 (4)

(9)荆飞. Toward Structural Controllability and Predictability in Directed Networks .IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS .2022

(10)冯洁茹. The edge colorings of K-5-minor free graphs .Discrete Mathematics .2021 ,344 (6)

(11)牛亚伟. Information spreading with relative attributes on signed networks .Information Sciences .2021 ,551 :54

(12)扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS .Discussiones Mathematicae Graph Theory .2021 ,41 (1):199

(13)宋繁鹏. Transcendental behavior and disturbance behavior favor human development .Applied Mathematics and Computation (New York) .2020 ,378

(14)Sun, Lin. THE LIST EDGE COLORING AND LIST TOTAL COLORING OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7 .Discussiones Mathematicae Graph Theory .2020 ,40 (4):1005

(15)Cheng, Xiaohan. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs .Discrete Mathematics .2020 ,343 (7)

(16)Liang, Zuosong. List-coloring clique-hypergraphs of K-5-minor-free graphs strongly .Discrete Mathematics .2020 ,343 (4)

(17)王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7 .Discrete Mathematics .2019 ,342 (6):1782

(18)王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7 .Discrete Mathematics .2019 ,342 (6):1782

(19)孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS .Discussiones Mathematicae Graph Theory .2019 ,39 (2):301

(20)胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 .Discrete Mathematics .2019 ,342 (5):1392

(21)胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 .Discrete Mathematics .2019 ,342 (5):1392

(22)孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS .Discussiones Mathematicae Graph Theory .2019 ,39 (2):301

(23)曲存全. Temporal information gathering process for node ranking in time-varying networks .Chaos .2019 ,29 (3)

(24)扈琳娜. A note on list edge coloring of planar graphs without adjacent short cycles .ARS Combinatoria .2019 ,143 :3

(25)丁来浩. Graphs are (1, Delta+1)-choosable .Discrete Mathematics .2019 ,342 (1):279

(26)丁来浩. Graphs are (1, Delta+1)-choosable .Discrete Mathematics .2019 ,342 (1):279

(27)张文文. Edge coloring of planar graphs without adjacent 7-cycles .Theoretical Computer Science .2018 ,739 :59

(28)张文文. Edge coloring of planar graphs without adjacent 7-cycles .Theoretical Computer Science .2018 ,739 :59

(29)胡代强. Planar graphs without chordal 6-cycles are 4-choosable .Discrete Applied Mathematics .2018 ,244 :116

(30)胡代强. Planar graphs without chordal 6-cycles are 4-choosable .Discrete Applied Mathematics .2018 ,244 :116

(31)计省进. On the first reformulated Zagreb indices of graphs with a given clique number .ARS Combinatoria .2018 ,140 :3

(32)计省进. On the first reformulated Zagreb indices of graphs with a given clique number .ARS Combinatoria .2018 ,140 :3

(33)董爱君. Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles .ARS Combinatoria .2018 ,139 :361

(34)董爱君. Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles .ARS Combinatoria .2018 ,139 :361

(35)王慧娟. Minimum choosability of planar graphs .Journal of Combinatorial Optimization .2018 ,36 (1):13

(36)王慧娟. Minimum choosability of planar graphs .Journal of Combinatorial Optimization .2018 ,36 (1):13

(37)付京成. Multipolarization versus unification in community networks .FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE .2018 ,83 :454

(38)Liu, Min. DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix .FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE .2018 ,83 :376

(39)杨东雷. On splitting digraphs .European Journal of Combinatorics .2018 ,71 :174

(40)付京成. Multipolarization versus unification in community networks .FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE .2018 ,83 :454

(41)杨东雷. On splitting digraphs .European Journal of Combinatorics .2018 ,71 :174

(42)王兵. TOTAL COLORINGS OF EMBEDDED GRAPHS WITH NO 3-CYCLES ADJACENT TO 4-CYCLES .Discussiones Mathematicae Graph Theory .2018 ,38 (4):977

(43)付京成. Multipolarization versus unification in community networks .Future Gener Comput Syst .2018 ,83 :454

(44)Liu, Min. DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix .FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE .2018 ,83 :376

(45)付京成. Multipolarization versus unification in community networks .Future Gener Comput Syst .2018 ,83 :454

(46)王兵. TOTAL COLORINGS OF EMBEDDED GRAPHS WITH NO 3-CYCLES ADJACENT TO 4-CYCLES .Discussiones Mathematicae Graph Theory .2018 ,38 (4):977

(47)Song, Huimin. List r-hued chromatic number of graphs with bounded maximum average degrees .Discrete Mathematics .2018 ,341 (5):1244

(48)Song, Huimin. List r-hued chromatic number of graphs with bounded maximum average degrees .Discrete Mathematics .2018 ,341 (5):1244

(49)丁来浩. Generalized acyclic edge colorings via entropy compression .Journal of Combinatorial Optimization .2018 ,35 (3):906

(50)张文文. A note on the edge colorings of planar graphs without 7-cycles with three chords .ARS Combinatoria .2018 ,138 :393

(51)张文文. A note on the edge colorings of planar graphs without 7-cycles with three chords .ARS Combinatoria .2018 ,138 :393

(52)丁来浩. Generalized acyclic edge colorings via entropy compression .Journal of Combinatorial Optimization .2018 ,35 (3):906

(53)张文文. Edge Colorings of Planar Graphs Without 6-Cycles with Three Chords .Bulletin of the Malaysian Mathematical Sciences Society .2018 ,41 (2):1077

(54)张文文. Edge Colorings of Planar Graphs Without 6-Cycles with Three Chords .Bulletin of the Malaysian Mathematical Sciences Society .2018 ,41 (2):1077

(55)蔡华. Vertex arboricity of planar graphs without intersecting 5-cycles .Journal of Combinatorial Optimization .2018 ,35 (2):365

(56)Wang, Haiying. List-edge-coloring of planar graphs without 6-cycles with three chords .Journal of Combinatorial Optimization .2018 ,35 (2):555

(57)蔡华. Vertex arboricity of planar graphs without intersecting 5-cycles .Journal of Combinatorial Optimization .2018 ,35 (2):365

(58)Wang, Haiying. List-edge-coloring of planar graphs without 6-cycles with three chords .Journal of Combinatorial Optimization .2018 ,35 (2):555

(59)成晓晗. The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven .Journal of Combinatorial Optimization .2018 ,35 (1):1

(60)Ji, Shengjin. A lower bound of revised Szeged index of bicyclic graphs .Applied Mathematics and Computation .2018 ,316 :480

(61)Ji, Shengjin. A lower bound of revised Szeged index of bicyclic graphs .Applied Mathematics and Computation .2018 ,316 :480

(62)成晓晗. The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven .Journal of Combinatorial Optimization .2018 ,35 (1):1

(63)杨东雷. Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 .Applied Mathematics and Computation .2017 , 314 :456

(64)杨东雷. Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 .Applied Mathematics and Computation .2017 ,314 :456

(65)Qi, Xingqin. Eb&D: A new clustering approach for signed social networks based on both edge-betweenness centrality and density of subgraphs .PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS .2017 ,482 :14

(66)Qi, Xingqin. Eb&D: A new clustering approach for signed social networks based on both edge-betweenness centrality and density of subgraphs .PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS .2017 ,482 :14

(67)成晓晗. The adjacent vertex distinguishing total chromatic numbers of planar graphs with Delta=10 .Journal of Combinatorial Optimization .2017 ,34 (2):383

(68)陈冠涛. Equitable vertex arboricity of 5-degenerate graphs .Journal of Combinatorial Optimization .2017 ,34 (2):426

(69)胡代强. Planar graphs without intersecting 5-cycles are 4-choosable .Discrete Mathematics .2017 ,340 (8):1788

(70)胡代强. Planar graphs without intersecting 5-cycles are 4-choosable .Discrete Mathematics .2017 ,340 (8):1788

(71)成晓晗. The adjacent vertex distinguishing total chromatic numbers of planar graphs with Delta=10 .Journal of Combinatorial Optimization .2017 , 34 (2):383

(72)陈冠涛. Equitable vertex arboricity of 5-degenerate graphs .Journal of Combinatorial Optimization .2017 ,34 (2):426

(73)孙林. The Wiener Index of r-Uniform Hypergraphs .Bulletin of the Malaysian Mathematical Sciences Society .2017 , 40 (3):1093

(74)胡代强. On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs .Graphs and Combinatorics .2017 ,33 (4):945

(75)丁来浩. Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz .Graphs and Combinatorics .2017 ,33 (4):885

(76)孙林. On total colorings of some special 1-planar graphs .ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES .2017 ,33 (3):607

(77)胡代强. On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs .Graphs and Combinatorics .2017 ,33 (4):945

(78)孙林. The Wiener Index of r-Uniform Hypergraphs .Bulletin of the Malaysian Mathematical Sciences Society .2017 ,40 (3):1093

(79)孙林. On total colorings of some special 1-planar graphs .ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES .2017 ,33 (3):607

(80)丁来浩. Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz .Graphs and Combinatorics .2017 , 33 (4):885

(81)许仁誉. A sufficient condition for a planar graph to be 4-choosable .Discrete Applied Mathematics .2017 , 224 :120

(82)许仁誉. A sufficient condition for a planar graph to be 4-choosable .Discrete Applied Mathematics .2017 ,224 :120

(83)付京成. Identification of leader and self-organizing communities in complex networks .Scientific Reports .2017 ,7

(84)付京成. Identification of leader and self-organizing communities in complex networks .scientific reports .2017 , 7

(85) Reinterpretaion of the friendship paradox .International Journal of Modern Physics C .2017 ,28 (2)

(86)付京成. Reinterpretaion of the friendship paradox .International Journal of Modern Physics C .2017 , 28 (2)

(87)孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles .Journal of Combinatorial Optimization .2017 ,33 (2):779

(88)于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs .Acta Mathematica Sinica-English Series .2017 ,33 (2):252

(89)付京成. Reinterpretaion of the friendship paradox .International Journal of Modern Physics C .2017 ,28 (2)

(90)于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs .Acta Mathematica Sinica-English Series .2017 , 33 (2):252

(91)孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles .Journal of Combinatorial Optimization .2017 ,33 (2):779

(92)付京成. A Deep Stochastic Model for Detecting Community in Complex Networks .Journal of Statistical Physics .2017 ,166 (2):230

(93)孙林. On (p, 1)-total labelling of planar graphs .Journal of Combinatorial Optimization .2017 , 33 (1):317

(94)孙林. On (p, 1)-total labelling of planar graphs .Journal of Combinatorial Optimization .2017 ,33 (1):317

(95)付京成. A Deep Stochastic Model for Detecting Community in Complex Networks .Journal of Statistical Physics .2017 , 166 (2):230

(96)Jianliang Wu. A Totally (Δ + 1)-colorable 1-planar Graph with Girth at Least Five .Acta Mathematica Sinica, English Series .2016 ,32 (11):1337

(97)Jianliang Wu. A Totally (Δ + 1)-colorable 1-planar Graph with Girth at Least Five .Acta Mathematica Sinica, English Series .2016 ,32 (11):1337

(98)Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture .Graphs and Combinatorics .2016 ,32 (4):1415

(99)Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture .Graphs and Combinatorics .2016 ,32 (4):1415

(100)高毓平. Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree .Bulletin of the Malaysian Mathematical Sciences Society .2016 ,39 :S247-S256

(101)Jianliang Wu. Total coloring of planar graphs without short cycles .Journal of Combinatorial Optimization .2016 ,31 (4):1650

(102)Jianliang Wu. Total coloring of planar graphs without short cycles .Journal of Combinatorial Optimization .2016 ,31 (4):1650

(103)Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic .Journal of Combinatorial Optimization .2016 ,31 (4):1430

(104)Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic .Journal of Combinatorial Optimization .2016 ,31 (4):1430

(105)Jianliang Wu. Leaders in communities of real-world networks .Physica A .2016 ,444 :428

(106)Jianliang Wu. Leaders in communities of real-world networks .Physica A .2016 ,444 :428

(107) Leaders in communities of real-world networks .PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS .2016 ,444

(108)Chen, Xiang-Lian. The Linear Arboricity of Planar Graphs without 5-Cycles with Two Chords .FILOMAT .2016 ,30 (5):1135-1142

(109)Jianliang Wu. On edge colorings of 1-planar graphs with 6-cycles having at most three chords .Int J Appl Math Stat. .2015 ,53 (1):50

(110)Jianliang Wu. On edge colorings of 1-planar graphs with 6-cycles having at most three chords .Int J Appl Math Stat. .2015 ,53 (1):50

(111)Jianliang Wu. Total Coloring of Planar Graphs Without Some Chordal 6-cycles .Bull. Malays. Math. Sci. Soc. .2015 ,38 (2):561

(112)Jianliang Wu. Total Coloring of Planar Graphs Without Some Chordal 6-cycles .Bull. Malays. Math. Sci. Soc. .2015 ,38 (2):561

(113)Jianliang Wu. Some sufficient conditions for 1-planar graphs to be Class 1 .Theoretical Computer Science .2015 ,566 :50

(114)Jianliang Wu. Some sufficient conditions for 1-planar graphs to be Class 1 .2015 ,566 :50

(115)徐进. Quantity strategies in economic networks .Operations Research Letters .2014 ,42 (6-7):379

(116)Jianliang Wu. Total colorings of planar graphs without chordal 6-cycles .Discrete Applied Mathematics .2014 ,171 :116

(117)Jianliang Wu. Total colorings of planar graphs without chordal 6-cycles .Discrete Applied Mathematics .2014 ,171 :116

(118)Jianliang Wu. SICR rumor spreading model in complex networks: Counterattack and self-resistance .2014 ,405 :159

(119)Jianliang Wu. SICR rumor spreading model in complex networks: Counterattack and self-resistance .PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS .2014 ,405 :159

(120)Jianliang Wu. Total colorings of planar graphs with sparse triangles .Theoretical Computer Science .2014 ,526 :120

(121)Jianliang Wu. Total colorings of planar graphs with sparse triangles .Theoretical Computer Science .2014 ,526 :120

(122)Jianliang Wu. Total colorings of F-5-free planar graphs with maximum degree 8 .the electronic journal of combinatorics .2014 ,21 (1):56

(123)Jianliang Wu. Total colorings of F-5-free planar graphs with maximum degree 8 .the electronic journal of combinatorics .2014 ,21 (1):56

(124)Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading .J Stat Phys .2014 ,154 (6):1569

(125)Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading .J Stat Phys .2014 ,154 (6):1569

(126)Jianliang Wu. Total coloring of planar graphs with maximum degree 8 .Theoretical Computer Science .2014 ,522 :54

(127)Jianliang Wu. Total coloring of planar graphs with maximum degree 8 .Theoretical Computer Science .2014 ,522 :54

(128)Jianliang Wu. Total coloring of planar graphs with 7-cycles containing at most two chords .Theoretical Computer Science .2014 ,520 :124

(129)Jianliang Wu. Total coloring of planar graphs with 7-cycles containing at most two chords .Theoretical Computer Science .2014 ,520 :124

(130)Jianliang Wu. Total coloring of embedded graphs with maximum degree at least seven .Theoretical Computer Science .2014 ,518 :1

(131)Jianliang Wu. Edge colorings of planar graphs without 5-cycles with two chords .Theoretical Computer Science .2014 ,518 :124

(132)Jianliang Wu. Total coloring of embedded graphs with maximum degree at least seven .Theoretical Computer Science .2014 ,518 :1

(133)Jianliang Wu. Edge colorings of planar graphs without 5-cycles with two chords .Theoretical Computer Science .2014 ,518 :124

(134)Jianliang Wu. Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications .《Journal of Applied Mathematics》 .2014 ,2014

(135)Jianliang Wu. A Note on List Edge and List Total Coloring of Planar Graphs without Adjacent Short Cycles .Acta Mathematica Sinica, English Series .2014 ,30 (1):91

(136)Jianliang Wu. Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications .《Journal of Applied Mathematics》 .2014 ,2014

(137)Jianliang Wu. A Note on List Edge and List Total Coloring of Planar Graphs without Adjacent Short Cycles .Acta Mathematica Sinica, English Series .2014 ,30 (1):91

(138)Jianliang Wu. On the sum of powers of the degrees of graphs .Bull. Aust. Math. Soc. .2013 ,88 :353

(139)Jianliang Wu. On the sum of powers of the degrees of graphs .Bull. Aust. Math. Soc. .2013 ,88 :353

(140)Jianliang Wu. Equitable vertex arboricity of graphs .Discrete Mathematics .2013 ,313 (6):2696

(141)Jianliang Wu. Equitable vertex arboricity of graphs .Discrete Mathematics .2013 ,313 (6):2696

(142)Jianliang Wu. The information transmission in community networks .Physica A .2013 ,392 :3827

(143)Jianliang Wu. The information transmission in community networks .Physica A .2013 ,392 :3827

(144)Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks .Commun. Theor. Phys .2013 ,60 (2):258

(145)Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks .Commun. Theor. Phys .2013 ,60 (2):258

(146)Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords .Theoretical Computer Science .2013 ,476 :16

(147)Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords .Theoretical Computer Science .2013 ,476 :16

(148)Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs” .MATCH Commun. Math. Comput. Chem. .2013 ,70 :467

(149)Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs” .MATCH Commun. Math. Comput. Chem. .2013 ,70 :467

(150)张欣. List edge and list total coloring of 1-planar graphs .FRONTIERS OF MATHEMATICS IN CHINA .2012 ,7 (5):1005-1018

(151)Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles .Discrete Applied Mathematics .2012 ,160 (12):1815

(152)Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles .Discrete Applied Mathematics .2012 ,160 (12):1815

(153)Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles .Discrete Mathematics .2012 ,312 (11):1923

(154)Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles .Discrete Mathematics .2012 ,312 (11):1923

(155)Cygan, Marek. A Planar linear arboricity conjecture .JOURNAL OF GRAPH THEORY .2012 ,69 (4):403-425

(156)Jianliang Wu. Degree conditions for the partition of a graph into triangles and quadrilaterals .UTILITAS MATHEMATICA .2011 ,86 :341

(157)Jianliang Wu. Degree conditions for the partition of a graph into triangles and quadrilaterals .UTILITAS MATHEMATICA .2011 ,86 :341

(158)Jianliang Wu. Total coloring of planar graphs with maximum degree 7 .information processing letters .2011 ,111 (20):1019

(159)Jianliang Wu. Total coloring of planar graphs with maximum degree 7 .information processing letters .2011 ,111 (20):1019

(160)Jianliang Wu. Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles .Discrete Mathematics .2011 ,311 (18-19):2025

(161)Jianliang Wu. Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles .Discrete Mathematics .2011 ,311 (18-19):2025

(162)王光辉. Circular vertex arboricity .Discrete Applied Mathematics .2011 ,159 (12):1231

(163)王光辉. Circular vertex arboricity .Discrete Applied Mathematics .2011 ,159 (12):1231

(164)王光辉. Circular vertex arboricity .Discrete Applied Mathematics .2011 ,159 (12):1231

(165)Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs .Discrete Mathematics .2011 ,311 (10-11):800

(166)Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs .Discrete Mathematics .2011 ,311 (10-11):800

(167)Hou, Jianfeng. Total coloring of planar graphs without 6-cycles .Discrete Applied Mathematics .2011 ,159 (2-3):157-163

(168)Jianliang Wu. On edge colorings of 1-planar graphs .information processing letters .2011 ,111 (3):124

(169)Jianliang Wu. On edge colorings of 1-planar graphs .information processing letters .2011 ,111 (3):124

(170)张欣. k-forested coloring of planar graphs with large girth .PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES .2010 ,86 (10):169-173

(171)Jianliang Wu. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t .Discrete Mathematics .2010 ,310 (19):2499

(172)张欣. Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t .Discrete Mathematics .2010 ,310 (19):2499-2503

(173)Jianliang Wu. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t .Discrete Mathematics .2010 ,310 (19):2499

(174)谭香. The Linear Arboricity of Planar Graphs without 5-cycles and 6-cycles .ARS Combinatoria .2010 ,97A :367-375

(175)侯建锋. Acyclic Edge Chromatic Number of Outerplanar Graphs .JOURNAL OF GRAPH THEORY .2010 ,64 (1):22-36

(176)谭香. The Linear Arboricity of Planar Graphswithout 5-cycles and 6-cycles .ARS Combinatoria .2010 :367-375

(177)刘彬. Total colorings and list total colorings of planar graphs without intersecting 4-cycles .Discrete Mathematics .2009 ,309 (20):6035-6043

(178)吴建良. A Note on The Linear Arboricity of Planar Graphs without 4-Cycles .Conference on Photonics Packaging, Integration, and Interconnects IX .2009 ,10 :174-+

(179)马勤. Planar graphs without 5-cycles or without 6-cycles .Discrete Mathematics .2009 ,309 (10):2998-3005

(180)孙向勇. Total colorings of planar graphs without adjacent triangles .Discrete Mathematics .2009 ,309 (1):202-206

(181)谭香. Total Coloring of Planar Graphs without Adacent 4-cycles .8th International Symposium on Operations Research and Its Applications .2009 ,10 :167-173

(182)Jianliang Wu. List-edge and list-total colorings of graphs embedded on hyperbolic surfaces .Discrete Mathematics .2008 ,308 (24):6210

(183)Jianliang Wu. List-edge and list-total colorings of graphs embedded on hyperbolic surfaces .Discrete Mathematics .2008 ,308 (24):6210

(184)Jianliang Wu. The linear arboricity of planar graphs of maximum degree seven is four .Journal of Graph Theory .2008 ,58 (3):210

(185)Jianliang Wu. The linear arboricity of planar graphs of maximum degree seven is four .Journal of Graph Theory .2008 ,58 (3):210

(186)Jianliang Wu. THE LINEAR ARBORICITY OF GRAPHS ON SURFACES OF NEGATIVE EULER CHARACTERISTIC .SIAM JOURNAL ON DISCRETE MATHEMATICS .2008 ,23 (1):54

(187)Jianliang Wu. THE LINEAR ARBORICITY OF GRAPHS ON SURFACES OF NEGATIVE EULER CHARACTERISTIC .SIAM JOURNAL ON DISCRETE MATHEMATICS .2008 ,23 (1):54

(188)吴建良. Equitable coloring planar graphs with large girth .Discrete Mathematics .2008 ,308 (5-6):985-990

(189)巩在武. 边临界图的新下界 .数学物理学报（英文版）（中国科学院） .2008 ,28 (2):367-372

(190)吴建良. The vertex linear arboricity of claw-free graphs with small degree .ARS Combinatoria .2008 ,86 :289-293

(191)吴建良. A linear algorithm for edge-face coloring series-parallel graphs .7th International Conference on Computational Science (ICCS 2007) .2007 ,4489 :389-+

(192)吴建良. The linear arboricity of planar graphs with no short cycles .Theoretical Computer Science .2007 ,381 (1-3):230-233

(193)吴建良. The entire coloring of series-parallel graphs .ACTA Math. Appl. Sinica (English Series) .2005 ,21 (1):61-66

(194)吴建良. 系列平行图的边面染色 .数学进展 .2005 ,34 (4):461-467

(195)宋慧敏. 几乎外平面图的边染色 .山东大学学报：工学版 .2004 ,34 (4):63-67

(196)宋慧敏. Halin图的均匀边染色 .山东大学学报 理学版 .2003 ,38 (2):32-34

(197)吴建良. On the linear arboricity of planar graphs .JOURNAL OF GRAPH THEORY .1999 ,31 (2):129-134

(198)吴建良. 关于图的边染色方面的一些结果 .山东大学学报自然科学版 .1999 ,34 (2):121-124

(199)刘家壮. 复合图的1－因子分解 .数学物理学报（英文版）（中国科学院） .1994 (03)

Research Projects

1. 图的曲面嵌入、图子式以及与边相关的染色问题, 2019-08-16-2023-12-31

2. 点邻域有限制条件的图的染色问题及其拓展研究, 2018-04-01-2021-07-01

3. 图理论和算法研究及其在生物信息学中的应用2, 2017-03-29-2021-12-31

4. 图的新染色问题以及在复杂网络中的应用, 2012-08-17-2016-12-31

5. 图的（t,k,d）-树染色问题的研究, 2010-01-01-2012-12-31

6. 生物信息学与最优化方法, 2007-01-01-2010-12-31

7. 图理论和算法研究及其在生物信息学中的应用, 2017-01-01, 在研