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

Jianliang Wu Professor

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

Paper Publications

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

[1] 杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discrete Mathematics, 346, 2023.
[2] 杨帆. <p>The total coloring of K-5-minor-free graphs</p>. European Journal of Combinatorics, 102, 2022.
[3] 冯洁茹. On generalized neighbor sum distinguishing index of planar graphs. DiscreteMathematicsAlgorithmsandApplications, 14, 2022.
[4] 荆飞. Toward Structural Controllability and Predictability in Directed Networks. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022.
[5] 冯洁茹. The edge colorings of K-5-minor free graphs. Discrete Mathematics, 344, 2021.
[6] 牛亚伟. Information spreading with relative attributes on signed networks. Information Sciences, 551, 54, 2021.
[7] 扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 41, 199, 2021.
[8] 宋繁鹏. Transcendental behavior and disturbance behavior favor human development. Applied Mathematics and Computation (New York), 378, 2020.
[9] 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.
[10] Cheng, Xiaohan. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discrete Mathematics, 343, 2020.
[11] Liang, Zuosong. List-coloring clique-hypergraphs of K-5-minor-free graphs strongly. Discrete Mathematics, 343, 2020.
[12] Jianliang Wu and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.
[13] Jianliang Wu and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.
[14] Jianliang Wu and 孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.
[15] Guanghui Wang , Jianliang Wu and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.
[16] Guanghui Wang , Jianliang Wu and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.
[17] Jianliang Wu and 孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.
[18] Qu Cunquan , Guanghui Wang and Jianliang Wu. Temporal information gathering process for node ranking in time-varying networks. Chaos, 29, 2019.
[19] 扈琳娜. A note on list edge coloring of planar graphs without adjacent short cycles. ARS Combinatoria, 143, 3, 2019.
[20] Guanghui Wang , Jianliang Wu and 丁来浩. Graphs are (1, Delta+1)-choosable. Discrete Mathematics, 342, 279, 2019.

total194 1/10

firstpreviousnext last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

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

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

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

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

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

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

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

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

[9] 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.

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

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

[12] Jianliang Wu and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.

[13] Jianliang Wu and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.

[14] Jianliang Wu and 孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.

[15] Guanghui Wang , Jianliang Wu and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.

[16] Guanghui Wang , Jianliang Wu and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.

[17] Jianliang Wu and 孙林. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.

[18] Qu Cunquan , Guanghui Wang and Jianliang Wu. Temporal information gathering process for node ranking in time-varying networks. Chaos, 29, 2019.

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

[20] Guanghui Wang , Jianliang Wu and 丁来浩. Graphs are (1, Delta+1)-choosable. Discrete Mathematics, 342, 279, 2019.