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

Jianliang Wu Professor

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

Paper Publications

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

[161] Jianliang Wu. Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles . Discrete Mathematics, 311, 2025, 2011.
[162] Guanghui Wang , Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.
[163] Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.
[164] Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.
[165] Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs . Discrete Mathematics, 311, 800, 2011.
[166] Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs . Discrete Mathematics, 311, 800, 2011.
[167] Hou, Jianfeng. Total coloring of planar graphs without 6-cycles. Discrete Applied Mathematics, 159, 157-163, 2011.
[168] Jianliang Wu. On edge colorings of 1-planar graphs. information processing letters, 111, 124, 2011.
[169] Jianliang Wu. On edge colorings of 1-planar graphs. information processing letters, 111, 124, 2011.
[170] 张欣. k-forested coloring of planar graphs with large girth. PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 86, 169-173, 2010.
[171] Jin Yan and Jianliang Wu. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.
[172] 张欣. Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499-2503, 2010.
[173] Jianliang Wu and Jin Yan. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.
[174] 谭香. The Linear Arboricity of Planar Graphs without 5-cycles and 6-cycles. ARS Combinatoria, 97A, 367-375, 2010.
[175] 侯建锋. Acyclic Edge Chromatic Number of Outerplanar Graphs. JOURNAL OF GRAPH THEORY, 64, 22-36, 2010.
[176] 谭香. The Linear Arboricity of Planar Graphswithout 5-cycles and 6-cycles. ARS Combinatoria, 367-375, 2010.
[177] 刘彬. Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Mathematics, 309, 6035-6043, 2009.
[178] 吴建良. A Note on The Linear Arboricity of Planar Graphs without 4-Cycles. 10, 174-+, 2009.
[179] 马勤. Planar graphs without 5-cycles or without 6-cycles. Discrete Mathematics, 309, 2998-3005, 2009.
[180] 孙向勇. Total colorings of planar graphs without adjacent triangles. Discrete Mathematics, 309, 202-206, 2009.

total199 9/10

first previous next last Page

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

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

[162] Guanghui Wang , Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.

[163] Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.

[164] Jianliang Wu and 王光辉. Circular vertex arboricity. Discrete Applied Mathematics, 159, 1231, 2011.

[165] Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs . Discrete Mathematics, 311, 800, 2011.

[166] Jianliang Wu. On equitable and equitable list colorings of series-parallel graphs . Discrete Mathematics, 311, 800, 2011.

[167] Hou, Jianfeng. Total coloring of planar graphs without 6-cycles. Discrete Applied Mathematics, 159, 157-163, 2011.

[168] Jianliang Wu. On edge colorings of 1-planar graphs. information processing letters, 111, 124, 2011.

[169] Jianliang Wu. On edge colorings of 1-planar graphs. information processing letters, 111, 124, 2011.

[170] 张欣. k-forested coloring of planar graphs with large girth. PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 86, 169-173, 2010.

[171] Jin Yan and Jianliang Wu. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.

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

[173] Jianliang Wu and Jin Yan. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.

[174] 谭香. The Linear Arboricity of Planar Graphs without 5-cycles and 6-cycles. ARS Combinatoria, 97A, 367-375, 2010.

[175] 侯建锋. Acyclic Edge Chromatic Number of Outerplanar Graphs. JOURNAL OF GRAPH THEORY, 64, 22-36, 2010.

[176] 谭香. The Linear Arboricity of Planar Graphswithout 5-cycles and 6-cycles. ARS Combinatoria, 367-375, 2010.

[177] 刘彬. Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Mathematics, 309, 6035-6043, 2009.

[178] 吴建良. A Note on The Linear Arboricity of Planar Graphs without 4-Cycles. 10, 174-+, 2009.

[179] 马勤. Planar graphs without 5-cycles or without 6-cycles. Discrete Mathematics, 309, 2998-3005, 2009.

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