YWYu-Wen Wu
Yu-Wen Wu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Yu-Wen Wu has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Guiying Yan
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
2 shared publications - Jian-Liang Wu
School of Mathematics, Shandong University, Jinan, China
1 shared publication - Kan-Ran Tan
Department of Computer Science, Whiting School of Engineering, Johns Hopkins University, Baltimore, MD 21218, USA
1 shared publication
Latest Publications
- 5 April 2016
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 32 (1) , 67-72
Improved bounds on the generalized acyclic chromatic number
- 5 April 2016
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 32 (1) , 67-72
Improved bounds on the generalized acyclic chromatic number
- 17 April 2014
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 30 (2) , 305-308
Improved upper bounds on acyclic edge colorings
- 17 April 2014
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 30 (2) , 305-308
Improved upper bounds on acyclic edge colorings
- 14 May 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 58 (3) , 210-220
The linear arboricity of planar graphs of maximum degree seven is four
The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph G. Wu wu proved the conjecture for a planar graph G of maximum degree $\Delta\not={{7}}$ . It is noted here that the conjecture is also true for $\Delta={{7}}$ . © 2008 Wiley Periodicals, Inc. J Graph Theory 58:210‐220, 2008- 14 May 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 58 (3) , 210-220
The linear arboricity of planar graphs of maximum degree seven is four
The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph G. Wu wu proved the conjecture for a planar graph G of maximum degree $\Delta\not={{7}}$ . It is noted here that the conjecture is also true for $\Delta={{7}}$ . © 2008 Wiley Periodicals, Inc. J Graph Theory 58:210‐220, 2008