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

Jianliang Wu Professor

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

Paper Publications

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

[81] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.
[82] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.
[83] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. Scientific Reports, 7, 2017.
[84] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. scientific reports, 7, 2017.
[85] Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.
[86] Jianliang Wu and 付京成. Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.
[87] Jianliang Wu and 孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. Journal of Combinatorial Optimization, 33, 779, 2017.
[88] Guanghui Wang , Jianliang Wu and 于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs. Acta Mathematica Sinica-English Series, 33, 252, 2017.
[89] Jianliang Wu and 付京成. Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.
[90] Guanghui Wang , Jianliang Wu and 于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs. Acta Mathematica Sinica-English Series, 33, 252, 2017.
[91] Jianliang Wu and 孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. Journal of Combinatorial Optimization, 33, 779, 2017.
[92] Jianliang Wu and 付京成. A Deep Stochastic Model for Detecting Community in Complex Networks. Journal of Statistical Physics, 166, 230, 2017.
[93] Jianliang Wu and 孙林. On (p, 1)-total labelling of planar graphs. Journal of Combinatorial Optimization, 33, 317, 2017.
[94] Jianliang Wu and 孙林. On (p, 1)-total labelling of planar graphs. Journal of Combinatorial Optimization, 33, 317, 2017.
[95] Jianliang Wu and 付京成. A Deep Stochastic Model for Detecting Community in Complex Networks. Journal of Statistical Physics, 166, 230, 2017.
[96] Jianliang Wu. A Totally (Δ + 1)-colorable 1-planar Graph with Girth at Least Five. Acta Mathematica Sinica, English Series, 32, 1337, 2016.
[97] Jianliang Wu. A Totally (Δ + 1)-colorable 1-planar Graph with Girth at Least Five. Acta Mathematica Sinica, English Series, 32, 1337, 2016.
[98] Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture. Graphs and Combinatorics, 32, 1415, 2016.
[99] Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture. Graphs and Combinatorics, 32, 1415, 2016.
[100] 高毓平. Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree. Bulletin of the Malaysian Mathematical Sciences Society, 39, S247-S256, 2016.

total199 5/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

[81] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.

[82] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.

[83] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. Scientific Reports, 7, 2017.

[84] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. scientific reports, 7, 2017.

[85] Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.

[86] Jianliang Wu and 付京成. Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.

[87] Jianliang Wu and 孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. Journal of Combinatorial Optimization, 33, 779, 2017.

[88] Guanghui Wang , Jianliang Wu and 于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs. Acta Mathematica Sinica-English Series, 33, 252, 2017.

[89] Jianliang Wu and 付京成. Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.

[90] Guanghui Wang , Jianliang Wu and 于筱蔚. Neighbor sum distinguishing edge coloring of subcubic graphs. Acta Mathematica Sinica-English Series, 33, 252, 2017.

[91] Jianliang Wu and 孙林. The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. Journal of Combinatorial Optimization, 33, 779, 2017.

[92] Jianliang Wu and 付京成. A Deep Stochastic Model for Detecting Community in Complex Networks. Journal of Statistical Physics, 166, 230, 2017.

[93] Jianliang Wu and 孙林. On (p, 1)-total labelling of planar graphs. Journal of Combinatorial Optimization, 33, 317, 2017.

[94] Jianliang Wu and 孙林. On (p, 1)-total labelling of planar graphs. Journal of Combinatorial Optimization, 33, 317, 2017.

[95] Jianliang Wu and 付京成. A Deep Stochastic Model for Detecting Community in Complex Networks. Journal of Statistical Physics, 166, 230, 2017.

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

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

[98] Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture. Graphs and Combinatorics, 32, 1415, 2016.

[99] Jianliang Wu. A Relaxed Case on 1-2-3 Conjecture. Graphs and Combinatorics, 32, 1415, 2016.

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