Jianliang Wu
Professor
本人现为山东大学教授、博士生导师。正式发表学术的论文有180余篇，连续主持和参与了国家级自然科学基金多项，参与并完成国家自然科学基金重点项目2项。主要研究方向:图理论及其算法, 复杂网络,知识图谱，图神经网络.图理论方面主要研究的是图的染色. Mathematical Reviews Web of Science More+
Paper Publications
-
[41] Jianliang Wu and 王兵. TOTAL COLORINGS OF EMBEDDED GRAPHS WITH NO 3-CYCLES ADJACENT TO 4-CYCLES. Discussiones Mathematicae Graph Theory, 38, 977, 2018.
-
[42] Jianliang Wu and Song, Huimin. List r-hued chromatic number of graphs with bounded maximum average degrees. Discrete Mathematics, 341, 1244, 2018.
-
[43] Jianliang Wu and Song, Huimin. List r-hued chromatic number of graphs with bounded maximum average degrees. Discrete Mathematics, 341, 1244, 2018.
-
[44] Guanghui Wang , Jianliang Wu and 丁来浩. Generalized acyclic edge colorings via entropy compression. Journal of Combinatorial Optimization, 35, 906, 2018.
-
[45] Jianliang Wu and zhangwenwen. A note on the edge colorings of planar graphs without 7-cycles with three chords. ARS Combinatoria, 138, 393, 2018.
-
[46] Jianliang Wu and zhangwenwen. A note on the edge colorings of planar graphs without 7-cycles with three chords. ARS Combinatoria, 138, 393, 2018.
-
[47] Guanghui Wang , Jianliang Wu and 丁来浩. Generalized acyclic edge colorings via entropy compression. Journal of Combinatorial Optimization, 35, 906, 2018.
-
[48] Jianliang Wu and zhangwenwen. Edge Colorings of Planar Graphs Without 6-Cycles with Three Chords. Bulletin of the Malaysian Mathematical Sciences Society, 41, 1077, 2018.
-
[49] Jianliang Wu and zhangwenwen. Edge Colorings of Planar Graphs Without 6-Cycles with Three Chords. Bulletin of the Malaysian Mathematical Sciences Society, 41, 1077, 2018.
-
[50] Jianliang Wu and caihua. Vertex arboricity of planar graphs without intersecting 5-cycles. Journal of Combinatorial Optimization, 35, 365, 2018.
-
[51] Jianliang Wu and Wang, Haiying. List-edge-coloring of planar graphs without 6-cycles with three chords. Journal of Combinatorial Optimization, 35, 555, 2018.
-
[52] Jianliang Wu and caihua. Vertex arboricity of planar graphs without intersecting 5-cycles. Journal of Combinatorial Optimization, 35, 365, 2018.
-
[53] Jianliang Wu and Wang, Haiying. List-edge-coloring of planar graphs without 6-cycles with three chords. Journal of Combinatorial Optimization, 35, 555, 2018.
-
[54] Jianliang Wu and 成晓晗. The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at lea.... Journal of Combinatorial Optimization, 35, 1, 2018.
-
[55] Jianliang Wu and Ji, Shengjin. A lower bound of revised Szeged index of bicyclic graphs. Applied Mathematics and Computation, 316, 480, 2018.
-
[56] Jianliang Wu and Ji, Shengjin. A lower bound of revised Szeged index of bicyclic graphs. Applied Mathematics and Computation, 316, 480, 2018.
-
[57] Jianliang Wu and 成晓晗. The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at lea.... Journal of Combinatorial Optimization, 35, 1, 2018.
-
[58] Jianliang Wu and 杨东雷. Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Applied Mathematics and Computation, 314, 456, 2017.
-
[59] Jianliang Wu and 杨东雷. Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Applied Mathematics and Computation, 314, 456, 2017.
-
[60] Jianliang Wu and Qi, Xingqin. Eb&D: A new clustering approach for signed social networks based on both edge-betweenness central.... PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 482, 14, 2017.