Jianliang Wu 山东大学主页平台管理系统--Home

Jianliang Wu Professor

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

Paper Publications

Home >> Scientific Resear... >> Paper Publication...

[101] Jianliang Wu. Total coloring of planar graphs without short cycles. Journal of Combinatorial Optimization, 31, 1650, 2016.
[102] Jianliang Wu. Total coloring of planar graphs without short cycles. Journal of Combinatorial Optimization, 31, 1650, 2016.
[103] Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler ch.... Journal of Combinatorial Optimization, 31, 1430, 2016.
[104] Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler ch.... Journal of Combinatorial Optimization, 31, 1430, 2016.
[105] Jianliang Wu. Leaders in communities of real-world networks. Physica A, 444, 428, 2016.
[106] Jianliang Wu. Leaders in communities of real-world networks. Physica A, 444, 428, 2016.
[107] Leaders in communities of real-world networks. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 444, 2016.
[108] Chen, Xiang-Lian. The Linear Arboricity of Planar Graphs without 5-Cycles with Two Chords. FILOMAT, 30, 1135-1142, 2016.
[109] Jianliang Wu. On edge colorings of 1-planar graphs with 6-cycles having at most three chords. Int J Appl Math Stat., 53, 50, 2015.
[110] Jianliang Wu. On edge colorings of 1-planar graphs with 6-cycles having at most three chords. Int J Appl Math Stat., 53, 50, 2015.
[111] Jianliang Wu. Total Coloring of Planar Graphs Without Some Chordal 6-cycles. Bull. Malays. Math. Sci. Soc., 38, 561, 2015.
[112] Jianliang Wu. Total Coloring of Planar Graphs Without Some Chordal 6-cycles. Bull. Malays. Math. Sci. Soc., 38, 561, 2015.
[113] Jianliang Wu. Some sufficient conditions for 1-planar graphs to be Class 1. Theoretical Computer Science , 566, 50, 2015.
[114] Jianliang Wu. Some sufficient conditions for 1-planar graphs to be Class 1. 566, 50, 2015.
[115] 徐进. Quantity strategies in economic networks. Operations Research Letters, 42, 379, 2014.
[116] Jianliang Wu. Total colorings of planar graphs without chordal 6-cycles. Discrete Applied Mathematics, 171, 116, 2014.
[117] Jianliang Wu. Total colorings of planar graphs without chordal 6-cycles. Discrete Applied Mathematics, 171, 116, 2014.
[118] Jianliang Wu. SICR rumor spreading model in complex networks: Counterattack and self-resistance. 405, 159, 2014.
[119] Jianliang Wu. SICR rumor spreading model in complex networks: Counterattack and self-resistance. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 405, 159, 2014.
[120] Jianliang Wu. Total colorings of planar graphs with sparse triangles . Theoretical Computer Science, 526, 120, 2014.

total199 6/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

[101] Jianliang Wu. Total coloring of planar graphs without short cycles. Journal of Combinatorial Optimization, 31, 1650, 2016.

[102] Jianliang Wu. Total coloring of planar graphs without short cycles. Journal of Combinatorial Optimization, 31, 1650, 2016.

[103] Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler ch.... Journal of Combinatorial Optimization, 31, 1430, 2016.

[104] Jianliang Wu. Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler ch.... Journal of Combinatorial Optimization, 31, 1430, 2016.

[105] Jianliang Wu. Leaders in communities of real-world networks. Physica A, 444, 428, 2016.

[106] Jianliang Wu. Leaders in communities of real-world networks. Physica A, 444, 428, 2016.

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

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

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

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

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

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

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

[114] Jianliang Wu. Some sufficient conditions for 1-planar graphs to be Class 1. 566, 50, 2015.

[115] 徐进. Quantity strategies in economic networks. Operations Research Letters, 42, 379, 2014.

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

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

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

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

[120] Jianliang Wu. Total colorings of planar graphs with sparse triangles . Theoretical Computer Science, 526, 120, 2014.