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

Jianliang Wu Professor

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

Paper Publications

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

[121] Jianliang Wu. Total colorings of planar graphs with sparse triangles . Theoretical Computer Science, 526, 120, 2014.
[122] Jianliang Wu. Total colorings of F-5-free planar graphs with maximum degree 8. the electronic journal of combinatorics, 21, 56, 2014.
[123] Jianliang Wu. Total colorings of F-5-free planar graphs with maximum degree 8. the electronic journal of combinatorics, 21, 56, 2014.
[124] Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading. J Stat Phys, 154, 1569, 2014.
[125] Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading. J Stat Phys, 154, 1569, 2014.
[126] Jianliang Wu. Total coloring of planar graphs with maximum degree 8. Theoretical Computer Science, 522, 54, 2014.
[127] Jianliang Wu. Total coloring of planar graphs with maximum degree 8. Theoretical Computer Science, 522, 54, 2014.
[128] Jianliang Wu. Total coloring of planar graphs with 7-cycles containing at most two chords. Theoretical Computer Science, 520, 124, 2014.
[129] Jianliang Wu. Total coloring of planar graphs with 7-cycles containing at most two chords. Theoretical Computer Science, 520, 124, 2014.
[130] Jianliang Wu. Total coloring of embedded graphs with maximum degree at least seven. Theoretical Computer Science, 518, 1, 2014.
[131] Jianliang Wu. Edge colorings of planar graphs without 5-cycles with two chords. Theoretical Computer Science, 518, 124, 2014.
[132] Jianliang Wu. Total coloring of embedded graphs with maximum degree at least seven. Theoretical Computer Science, 518, 1, 2014.
[133] Jianliang Wu. Edge colorings of planar graphs without 5-cycles with two chords. Theoretical Computer Science, 518, 124, 2014.
[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, 30, 91, 2014.
[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, 30, 91, 2014.
[138] Jianliang Wu. On the sum of powers of the degrees of graphs. Bull. Aust. Math. Soc., 88, 353, 2013.
[139] Jianliang Wu. On the sum of powers of the degrees of graphs. Bull. Aust. Math. Soc., 88, 353, 2013.
[140] Jianliang Wu. Equitable vertex arboricity of graphs. Discrete Mathematics, 313, 2696, 2013.

total199 7/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

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

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

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

[124] Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading. J Stat Phys, 154, 1569, 2014.

[125] Jianliang Wu. The Influence of Human Heterogeneity to Information Spreading. J Stat Phys, 154, 1569, 2014.

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

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

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

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

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

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

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

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

[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, 30, 91, 2014.

[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, 30, 91, 2014.

[138] Jianliang Wu. On the sum of powers of the degrees of graphs. Bull. Aust. Math. Soc., 88, 353, 2013.

[139] Jianliang Wu. On the sum of powers of the degrees of graphs. Bull. Aust. Math. Soc., 88, 353, 2013.

[140] Jianliang Wu. Equitable vertex arboricity of graphs. Discrete Mathematics, 313, 2696, 2013.