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

Jianliang Wu Professor

本人现为山东大学教授、博士生导师。正式发表学术的论文有180余篇，近五年来发表SCI收录论文60多篇，从新世纪以来连续主持和参与了国家级自然科学基金多项，参与并完成国家自然科学基金重点项目2项。目前主持国家自然科学基金和山东省自然科学基金各1项, 参与国家重点项目1项。主要研究方向:图理论及其算法, 知识图谱，图神经网咯 Mathematical Reviews Web of Science More+

Paper Publications

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

[21] 刘家壮. 复合图的1－因子分解. 数学物理学报, 1994.
[22] 孙向勇. Total colorings of planar graphs without adjacent triangles. Discrete Mathematics, 309, 202-206, 2009.
[23] Cygan, Marek. A Planar linear arboricity conjecture. JOURNAL OF GRAPH THEORY, 69, 403-425, 2012.
[24] 张欣. List edge and list total coloring of 1-planar graphs. FRONTIERS OF MATHEMATICS IN CHINA, 7, 1005-1018, 2012.
[25] 高毓平. Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree. Bulletin of the Malaysian Mathematical Sciences Society, 39, S247-S256, 2016.
[26] Chen, Xiang-Lian. The Linear Arboricity of Planar Graphs without 5-Cycles with Two Chords. FILOMAT, 30, 1135-1142, 2016.
[27] 杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discrete Mathematics, 346, 2023.
[28] 冯洁茹. On generalized neighbor sum distinguishing index of planar graphs. DiscreteMathematicsAlgorithmsandApplications, 14, 2022.
[29] 张欣. Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499-2503, 2010.
[30] 荆飞. Toward Structural Controllability and Predictability in Directed Networks. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022.
[31] 杨帆. <p>The total coloring of K-5-minor-free graphs</p>. European Journal of Combinatorics, 102, 2022.
[32] 扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 41, 199, 2021.
[33] Liang, Zuosong. List-coloring clique-hypergraphs of K-5-minor-free graphs strongly. Discrete Mathematics, 343, 2020.
[34] Cheng, Xiaohan. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discrete Mathematics, 343, 2020.
[35] 宋繁鹏. Transcendental behavior and disturbance behavior favor human development. Applied Mathematics and Computation (New York), 378, 2020.
[36] Sun, Lin. THE LIST EDGE COLORING AND LIST TOTAL COLORING OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7. Discussiones Mathematicae Graph Theory, 40, 1005, 2020.
[37] 牛亚伟. Information spreading with relative attributes on signed networks. Information Sciences, 551, 54, 2021.
[38] 冯洁茹. The edge colorings of K-5-minor free graphs. Discrete Mathematics, 344, 2021.
[39] 扈琳娜. A note on list edge coloring of planar graphs without adjacent short cycles. ARS Combinatoria, 143, 3, 2019.
[40] 徐进. Quantity strategies in economic networks. Operations Research Letters, 42, 379, 2014.

total194 2/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

[21] 刘家壮. 复合图的1－因子分解. 数学物理学报, 1994.

[22] 孙向勇. Total colorings of planar graphs without adjacent triangles. Discrete Mathematics, 309, 202-206, 2009.

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

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

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

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

[27] 杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discrete Mathematics, 346, 2023.

[28] 冯洁茹. On generalized neighbor sum distinguishing index of planar graphs. DiscreteMathematicsAlgorithmsandApplications, 14, 2022.

[29] 张欣. Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499-2503, 2010.

[30] 荆飞. Toward Structural Controllability and Predictability in Directed Networks. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022.

[31] 杨帆. <p>The total coloring of K-5-minor-free graphs</p>. European Journal of Combinatorics, 102, 2022.

[32] 扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 41, 199, 2021.

[33] Liang, Zuosong. List-coloring clique-hypergraphs of K-5-minor-free graphs strongly. Discrete Mathematics, 343, 2020.

[34] Cheng, Xiaohan. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discrete Mathematics, 343, 2020.

[35] 宋繁鹏. Transcendental behavior and disturbance behavior favor human development. Applied Mathematics and Computation (New York), 378, 2020.

[36] Sun, Lin. THE LIST EDGE COLORING AND LIST TOTAL COLORING OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7. Discussiones Mathematicae Graph Theory, 40, 1005, 2020.

[37] 牛亚伟. Information spreading with relative attributes on signed networks. Information Sciences, 551, 54, 2021.

[38] 冯洁茹. The edge colorings of K-5-minor free graphs. Discrete Mathematics, 344, 2021.

[39] 扈琳娜. A note on list edge coloring of planar graphs without adjacent short cycles. ARS Combinatoria, 143, 3, 2019.

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