List-Avoiding Orientations - Peter Bradshaw; Yaobin Chen; Hao Ma; Bojan Mohar; Hehui Wu (Comb., 2024)

Graph partitions under average degree constraint - Yan Wang; Hehui Wu (J. Comb. Theory B, 2024)

The inducibility of oriented stars - Ping Hu; Jie Ma; Sergey Norin; Hehui Wu (J. Comb. Theory B, 2024)

Proper orientations and proper chromatic number - Yaobin Chen; Bojan Mohar; Hehui Wu (J. Comb. Theory B, 2023)

Subgraphs of Kneser graphs with large girth and large chromatic number - Bojan Mohar; Hehui Wu (Art Discret. Appl. Math., 2022)

On the Turán Number of the Linear 3-Graph C\(_13\) - Chaoliang Tang; Hehui Wu; Shengtong Zhang; Zeyu Zheng (Electron. J. Comb., 2022)

Triangle-free subgraphs with large fractional chromatic number - Bojan Mohar; Hehui Wu (Comb. Probab. Comput., 2022)

1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio - Zdenek Dvorák; Patrice Ossona de Mendez; Hehui Wu (Comb., 2020)

Fractional chromatic number of a random subgraph - Bojan Mohar; Hehui Wu (J. Graph Theory, 2020)

Coloring tournaments: From local to global - Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé; Hehui Wu (J. Comb. Theory B, 2019)

The extremal function for disconnected minors - Endre Csóka; Irene Lo; Sergey Norin; Hehui Wu; Liana Yepremyan (J. Comb. Theory B, 2017)

Interval Minors of Complete Bipartite Graphs - Bojan Mohar; Arash Rafiey; Behruz Tayfeh-Rezaie; Hehui Wu (J. Graph Theory, 2016)

Weak duality for packing edge-disjoint odd (u, v)-trails - Ross Churchley; Bojan Mohar; Hehui Wu (Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016)

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices - Jonathan A. Noel; Douglas B. West; Hehui Wu; Xuding Zhu (Eur. J. Comb., 2015)

Triangle-free subgraphs with large fractional chromatic number - Bojan Mohar; Hehui Wu (Electron. Notes Discret. Math., 2015)

A Proof of a Conjecture of Ohba - Jonathan A. Noel; Bruce A. Reed; Hehui Wu (J. Graph Theory, 2015)

Large Supports are Required for Well-Supported Nash Equilibria - Yogesh Anbalagan; Hao Huang; Shachar Lovett; Sergey Norin; Adrian Vetta; Hehui Wu (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, 2015)

Large Supports are required for Well-Supported Nash Equilibria - Yogesh Anbalagan; Hao Huang; Shachar Lovett; Sergey Norin; Adrian Vetta; Hehui Wu (CoRR, 2015)

Interval minors of complete bipartite graphs - Bojan Mohar; Arash Rafiey; Behruz Tayfeh-Rezaie; Hehui Wu (CoRR, 2014)

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond - Jonathan A. Noel; Bruce A. Reed; Douglas B. West; Hehui Wu; Xuding Zhu (Electron. Notes Discret. Math., 2013)

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree - Seog-Jin Kim; Alexandr V. Kostochka; Douglas B. West; Hehui Wu; Xuding Zhu (J. Graph Theory, 2013)

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices - Jonathan A. Noel; Douglas B. West; Hehui Wu; Xuding Zhu (CoRR, 2013)

Packing of Steiner trees and S-connectors in graphs - Douglas B. West; Hehui Wu (J. Comb. Theory B, 2012)

A Proof of a Conjecture of Ohba - Jonathan A. Noel; Bruce A. Reed; Hehui Wu (CoRR, 2012)

Complete minors, independent sets, and chordal graphs - József Balogh; John Lenz; Hehui Wu (Discuss. Math. Graph Theory, 2011)

Longest cycles in k-connected graphs with given independence number - Suil O; Douglas B. West; Hehui Wu (J. Comb. Theory B, 2011)

On mod (2p+1)-orientations of graphs - Hong-Jian Lai; Yehong Shao; Hehui Wu; Ju Zhou (J. Comb. Theory B, 2009)

Optimal strong parity edge-coloring of complete graphs - David P. Bunde; Kevin G. Milans; Douglas B. West; Hehui Wu (Comb., 2008)

The hub number of a graph - Tracy Grauman; Stephen G. Hartke; Adam S. Jobson; William B. Kinnersley; Douglas B. West; Lesley Wiglesworth; Pratik Worah; Hehui Wu (Inf. Process. Lett., 2008)

Every 3-connected, essentially 11-connected line graph is Hamiltonian - Hong-Jian Lai; Yehong Shao; Hehui Wu; Ju Zhou (J. Comb. Theory B, 2006)