Hehui Wu

According to our database, Hehui Wu authored at least 24 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Graph partitions under average degree constraint.

Yan Wang, Hehui Wu

J. Comb. Theory, Ser. B, March, 2024

2023

Proper orientations and proper chromatic number.

Yaobin Chen, Bojan Mohar, Hehui Wu

J. Comb. Theory, Ser. B, July, 2023

2022

Subgraphs of Kneser graphs with large girth and large chromatic number.

Bojan Mohar, Hehui Wu

Art Discret. Appl. Math., December, 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

2020

Fractional chromatic number of a random subgraph.

Bojan Mohar, Hehui Wu

J. Graph Theory, 2020

1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio.

Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu

Comb., 2020

2019

Coloring tournaments: From local to global.

Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu

J. Comb. Theory, Ser. B, 2019

2017

The extremal function for disconnected minors.

Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan

J. Comb. Theory, Ser. B, 2017

2016

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 (<i>u, v</i>)-trails.

Ross Churchley, Bojan Mohar, Hehui Wu

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

A Proof of a Conjecture of Ohba.

Jonathan A. Noel, Bruce A. Reed, Hehui Wu

J. Graph Theory, 2015

Triangle-free subgraphs with large fractional chromatic number.

Bojan Mohar, Hehui Wu

Electron. Notes Discret. Math., 2015

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

Large Supports are Required for Well-Supported Nash Equilibria.

Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu

Proceedings of the Approximation, 2015

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

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

Beyond Ohba's Conjecture: A bound on the choice number of <i>k</i>-chromatic graphs with <i>n</i> vertices.

Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu

CoRR, 2013

2012

Packing of Steiner trees and S-connectors in graphs.

Douglas B. West, Hehui Wu

J. Comb. Theory, Ser. B, 2012

2011

Longest cycles in k-connected graphs with given independence number.

Suil O, Douglas B. West, Hehui Wu

J. Comb. Theory, Ser. B, 2011

Complete minors, independent sets, and chordal graphs.

József Balogh, John Lenz, Hehui Wu

Discuss. Math. Graph Theory, 2011

2009

On mod (2p+1)-orientations of graphs.

Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou

J. Comb. Theory, Ser. B, 2009

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

Optimal strong parity edge-coloring of complete graphs.

David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu

Comb., 2008

2006

Every 3-connected, essentially 11-connected line graph is Hamiltonian.

Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou

J. Comb. Theory, Ser. B, 2006