Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jian-Liang Wu
2010 – today
- 2013
[j12]Jian-Feng Hou, Jian-Liang Wu: Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs". Journal of Graph Theory 72(3): 364-365 (2013)- [j11]Jian Chang, Hui-Juan Wang, Jian-Liang Wu, Yong-Ga A: Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theor. Comput. Sci. 476: 16-23 (2013)
- 2012
- [j10]Hui-Juan Wang, Jian-Liang Wu: A note on the total coloring of planar graphs without adjacent 4-cycles. Discrete Mathematics 312(11): 1923-1926 (2012)
- [j9]Marek Cygan, Jian-Feng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu: A Planar linear arboricity conjecture. Journal of Graph Theory 69(4): 403-425 (2012)
- 2011
- [j8]Jian-Liang Wu, Yu-Wen Wu: Edge colorings of planar graphs with maximum degree five. Ars Comb. 98: 183-191 (2011)
2000 – 2009
- 2009
- [j7]Qin Ma, Jian-Liang Wu, Xiao Yu: Planar graphs without 5-cycles or without 6-cycles. Discrete Mathematics 309(10): 2998-3005 (2009)
- 2008
- [j6]Jian-Liang Wu, Yu-Liang Wu: The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree. Ars Comb. 86 (2008)
- [j5]Jian-Liang Wu, Yu-Wen Wu: The linear arboricity of planar graphs of maximum degree seven is four. Journal of Graph Theory 58(3): 210-220 (2008)
- [j4]Jian-Liang Wu: The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic. SIAM J. Discrete Math. 23(1): 54-58 (2008)
- 2004
- [j3]
- [j2]Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu: Minimum average distance of strong orientations of graphs. Discrete Applied Mathematics 143(1-3): 204-212 (2004)
1990 – 1999
- 1999
- [j1]Jian-Liang Wu: On the linear arboricity of planar graphs. Journal of Graph Theory 31(2): 129-134 (1999)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-28 20:47 CEST by the dblp team