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

Jianliang Wu Professor

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

Paper Publications

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

[141] Jianliang Wu. Equitable vertex arboricity of graphs. Discrete Mathematics, 313, 2696, 2013.
[142] Jianliang Wu. The information transmission in community networks. Physica A, 392, 3827, 2013.
[143] Jianliang Wu. The information transmission in community networks. Physica A, 392, 3827, 2013.
[144] Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks. Commun. Theor. Phys, 60, 258, 2013.
[145] Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks. Commun. Theor. Phys, 60, 258, 2013.
[146] Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theoretical Computer Science, 476, 16, 2013.
[147] Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theoretical Computer Science, 476, 16, 2013.
[148] Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs”. MATCH Commun. Math. Comput. Chem., 70, 467, 2013.
[149] Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs”. MATCH Commun. Math. Comput. Chem., 70, 467, 2013.
[150] 张欣. List edge and list total coloring of 1-planar graphs. FRONTIERS OF MATHEMATICS IN CHINA, 7, 1005-1018, 2012.
[151] Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles. Discrete Applied Mathematics, 160, 1815, 2012.
[152] Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles. Discrete Applied Mathematics, 160, 1815, 2012.
[153] Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles. Discrete Mathematics, 312, 1923, 2012.
[154] Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles. Discrete Mathematics, 312, 1923, 2012.
[155] Cygan, Marek. A Planar linear arboricity conjecture. JOURNAL OF GRAPH THEORY, 69, 403-425, 2012.
[156] Jin Yan and Jianliang Wu. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.
[157] Jianliang Wu , XWFZR and Jin Yan. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.
[158] Jianliang Wu. Total coloring of planar graphs with maximum degree 7. information processing letters, 111, 1019, 2011.
[159] Jianliang Wu. Total coloring of planar graphs with maximum degree 7. information processing letters, 111, 1019, 2011.
[160] Jianliang Wu. Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles . Discrete Mathematics, 311, 2025, 2011.

total199 8/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

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

[142] Jianliang Wu. The information transmission in community networks. Physica A, 392, 3827, 2013.

[143] Jianliang Wu. The information transmission in community networks. Physica A, 392, 3827, 2013.

[144] Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks. Commun. Theor. Phys, 60, 258, 2013.

[145] Jianliang Wu. Detecting Communities by Revised Max-flow Method in Networks. Commun. Theor. Phys, 60, 258, 2013.

[146] Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theoretical Computer Science, 476, 16, 2013.

[147] Jianliang Wu. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theoretical Computer Science, 476, 16, 2013.

[148] Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs”. MATCH Commun. Math. Comput. Chem., 70, 467, 2013.

[149] Jianliang Wu. Erratum to “The vertex PI and Szeged indices of chain graphs”. MATCH Commun. Math. Comput. Chem., 70, 467, 2013.

[150] 张欣. List edge and list total coloring of 1-planar graphs. FRONTIERS OF MATHEMATICS IN CHINA, 7, 1005-1018, 2012.

[151] Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles. Discrete Applied Mathematics, 160, 1815, 2012.

[152] Jianliang Wu. Total colorings of planar graphs without intersecting 5-cycles. Discrete Applied Mathematics, 160, 1815, 2012.

[153] Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles. Discrete Mathematics, 312, 1923, 2012.

[154] Jianliang Wu. A note on the total coloring of planar graphs without adjacent 4-cycles. Discrete Mathematics, 312, 1923, 2012.

[155] Cygan, Marek. A Planar linear arboricity conjecture. JOURNAL OF GRAPH THEORY, 69, 403-425, 2012.

[156] Jin Yan and Jianliang Wu. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.

[157] Jianliang Wu , XWFZR and Jin Yan. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.

[158] Jianliang Wu. Total coloring of planar graphs with maximum degree 7. information processing letters, 111, 1019, 2011.

[159] Jianliang Wu. Total coloring of planar graphs with maximum degree 7. information processing letters, 111, 1019, 2011.

[160] Jianliang Wu. Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles . Discrete Mathematics, 311, 2025, 2011.