吴建良
-
教授
博士生导师
硕士生导师
- 性别:男
- 毕业院校:山东大学
- 学历:博士研究生毕业
- 学位:理学博士学位
- 在职信息:在职
- 所在单位:数学学院
- 入职时间: 2003-03-01
- 学科:运筹学与控制论
- 办公地点:山大南路山东大学中心校区知新楼B1054
访问量:
-
[1]
宋慧敏.
Halin图的均匀边染色.
山东大学学报 理学版,
38,
32-34,
2003.
-
[2]
吴建良.
A linear algorithm for edge-face coloring series-parallel graphs.
4489,
389-+,
2007.
-
[3]
吴建良.
系列平行图的边面染色.
数学进展,
34,
461-467,
2005.
-
[4]
刘彬.
Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discrete Mathematics,
309,
6035-6043,
2009.
-
[5]
吴建良.
A Note on The Linear Arboricity of Planar Graphs without 4-Cycles.
10,
174-+,
2009.
-
[6]
谭香.
Total Coloring of Planar Graphs without Adacent 4-cycles.
10,
167-173,
2009.
-
[7]
巩在武.
边临界图的新下界.
数学物理学报(英文版)(中国科学院),
28,
367-372,
2008.
-
[8]
马勤.
Planar graphs without 5-cycles or without 6-cycles.
Discrete Mathematics,
309,
2998-3005,
2009.
-
[9]
吴建良.
The linear arboricity of planar graphs with no short cycles.
Theoretical Computer Science,
381,
230-233,
2007.
-
[10]
谭香.
The Linear Arboricity of Planar Graphswithout 5-cycles and 6-cycles.
ARS Combinatoria,
367-375,
2010.
-
[11]
谭香.
The Linear Arboricity of Planar Graphs without 5-cycles and 6-cycles.
ARS Combinatoria,
97A,
367-375,
2010.
-
[12]
张欣.
k-forested coloring of planar graphs with large girth.
PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES,
86,
169-173,
2010.
-
[13]
侯建锋.
Acyclic Edge Chromatic Number of Outerplanar Graphs.
JOURNAL OF GRAPH THEORY,
64,
22-36,
2010.
-
[14]
Hou, Jianfeng.
Total coloring of planar graphs without 6-cycles.
Discrete Applied Mathematics,
159,
157-163,
2011.
-
[15]
吴建良.
The entire coloring of series-parallel graphs.
ACTA Math. Appl. Sinica (English Series),
21,
61-66,
2005.
-
[16]
吴建良.
关于图的边染色方面的一些结果.
山东大学学报自然科学版,
34,
121-124,
1999.
-
[17]
宋慧敏.
几乎外平面图的边染色.
山东大学学报:工学版,
34,
63-67,
2004.
-
[18]
吴建良.
The vertex linear arboricity of claw-free graphs with small degree.
ARS Combinatoria,
86,
289-293,
2008.
-
[19]
吴建良.
Equitable coloring planar graphs with large girth.
Discrete Mathematics,
308,
985-990,
2008.
-
[20]
吴建良.
On the linear arboricity of planar graphs.
JOURNAL OF GRAPH THEORY,
31,
129-134,
1999.