Hehui Wu, Ph.D.
Affiliations: | 2011 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
Applied Mathematics, MathematicsGoogle:
"Hehui Wu"Parents
Sign in to add mentor| Alexandr Kostochka | grad student | 2011 | UIUC | |
| (Extremal problems on cycles, packing, and decomposition of graphs.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Noel JA, Reed BA, Wu H. (2014) A proof of a conjecture of Ohba Journal of Graph Theory. 79: 86-102 |
| Kim SJ, Kostochka AV, West DB, et al. (2013) Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree Journal of Graph Theory. 74: 369-391 |
| West DB, Wu H. (2012) Packing of Steiner trees and S-connectors in graphs Journal of Combinatorial Theory. Series B. 102: 186-205 |
| Balogh J, Lenz J, Wu H. (2011) Complete minors, independent sets, and chordal graphs Discussiones Mathematicae - Graph Theory. 31: 639-674 |
| O S, West DB, Wu H. (2011) Longest cycles in k-connected graphs with given independence number Journal of Combinatorial Theory, Series B. 101: 480-485 |
| Lai H, Shao Y, Wu H, et al. (2009) On mod (2p +1)-orientations of graphs Journal of Combinatorial Theory, Series B. 99: 399-406 |
| Grauman T, Hartke SG, Jobson A, et al. (2008) The hub number of a graph Information Processing Letters. 108: 226-228 |
| Bunde DP, Milans K, West DB, et al. (2008) Optimal strong parity edge-coloring of complete graphs Combinatorica. 28: 625-632 |
| Lai H, Shao Y, Wu H, et al. (2006) Every 3-connected, essentially 11-connected line graph is Hamiltonian Journal of Combinatorial Theory, Series B. 96: 571-576 |