Jianliang Wu
Professor
本人现为山东大学教授、博士生导师。正式发表学术的论文有180余篇，连续主持和参与了国家级自然科学基金多项，参与并完成国家自然科学基金重点项目2项。主要研究方向:图理论及其算法, 复杂网络,知识图谱，图神经网络.图理论方面主要研究的是图的染色. Mathematical Reviews Web of Science More+
Paper Publications
-
[21] Guanghui Wang , Jianliang Wu and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.
-
[22] Jianliang Wu and 孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.
-
[23] Qu Cunquan , Guanghui Wang and Jianliang Wu. Temporal information gathering process for node ranking in time-varying networks. Chaos, 29, 2019.
-
[24] 扈琳娜. A note on list edge coloring of planar graphs without adjacent short cycles. ARS Combinatoria, 143, 3, 2019.
-
[25] Guanghui Wang , Jianliang Wu and 丁来浩. Graphs are (1, Delta+1)-choosable. Discrete Mathematics, 342, 279, 2019.
-
[26] Guanghui Wang , Jianliang Wu and 丁来浩. Graphs are (1, Delta+1)-choosable. Discrete Mathematics, 342, 279, 2019.
-
[27] Jianliang Wu and zhangwenwen. Edge coloring of planar graphs without adjacent 7-cycles. Theoretical Computer Science, 739, 59, 2018.
-
[28] Jianliang Wu and zhangwenwen. Edge coloring of planar graphs without adjacent 7-cycles. Theoretical Computer Science, 739, 59, 2018.
-
[29] Jianliang Wu and 胡代强. Planar graphs without chordal 6-cycles are 4-choosable. Discrete Applied Mathematics, 244, 116, 2018.
-
[30] Jianliang Wu and 胡代强. Planar graphs without chordal 6-cycles are 4-choosable. Discrete Applied Mathematics, 244, 116, 2018.
-
[31] Jianliang Wu and 计省进. On the first reformulated Zagreb indices of graphs with a given clique number. ARS Combinatoria, 140, 3, 2018.
-
[32] Jianliang Wu and 计省进. On the first reformulated Zagreb indices of graphs with a given clique number. ARS Combinatoria, 140, 3, 2018.
-
[33] Jianliang Wu and 董爱君. Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. ARS Combinatoria, 139, 361, 2018.
-
[34] Jianliang Wu and 董爱君. Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. ARS Combinatoria, 139, 361, 2018.
-
[35] Jianliang Wu and 王慧娟. Minimum choosability of planar graphs. Journal of Combinatorial Optimization, 36, 13, 2018.
-
[36] Jianliang Wu and 王慧娟. Minimum choosability of planar graphs. Journal of Combinatorial Optimization, 36, 13, 2018.
-
[37] Guanghui Wang , Jianliang Wu and 付京成. Multipolarization versus unification in community networks. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 83, 454, 2018.
-
[38] Jianliang Wu and Liu, Min. DPRank centrality: Finding important vertices based on random walks with a new defined transition.... FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 83, 376, 2018.
-
[39] Guanghui Wang , Jianliang Wu and 杨东雷. On splitting digraphs. European Journal of Combinatorics, 71, 174, 2018.
-
[40] Guanghui Wang , Jianliang Wu and 付京成. Multipolarization versus unification in community networks. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 83, 454, 2018.