default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHehui Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu:
List-Avoiding Orientations. Comb. 44(5): 1091-1113 (2024)- [j23]Yan Wang, Hehui Wu
:
Graph partitions under average degree constraint. J. Comb. Theory B 165: 197-210 (2024) - [j22]Ping Hu, Jie Ma, Sergey Norin, Hehui Wu:
The inducibility of oriented stars. J. Comb. Theory B 168: 11-46 (2024) - 2023
- [j21]Yaobin Chen, Bojan Mohar, Hehui Wu:
Proper orientations and proper chromatic number. J. Comb. Theory B 161: 63-85 (2023) - 2022
- [j20]Bojan Mohar, Hehui Wu:
Subgraphs of Kneser graphs with large girth and large chromatic number. Art Discret. Appl. Math. 6(2): 2 (2022) - [j19]Chaoliang Tang, Hehui Wu, Shengtong Zhang, Zeyu Zheng:
On the Turán Number of the Linear 3-Graph C13. Electron. J. Comb. 29(3) (2022) - [j18]Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. Comb. Probab. Comput. 31(1): 136-143 (2022) - 2020
- [j17]Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu:
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Comb. 40(6): 759-774 (2020) - [j16]Bojan Mohar, Hehui Wu:
Fractional chromatic number of a random subgraph. J. Graph Theory 95(3): 467-472 (2020)
2010 – 2019
- 2019
- [j15]Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu:
Coloring tournaments: From local to global. J. Comb. Theory B 138: 166-171 (2019) - 2017
- [j14]Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan:
The extremal function for disconnected minors. J. Comb. Theory B 126: 162-174 (2017) - 2016
- [j13]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval Minors of Complete Bipartite Graphs. J. Graph Theory 82(3): 312-321 (2016) - [c2]Ross Churchley, Bojan Mohar, Hehui Wu:
Weak duality for packing edge-disjoint odd (u, v)-trails. SODA 2016: 2086-2094 - 2015
- [j12]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. Eur. J. Comb. 43: 295-305 (2015) - [j11]Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. Electron. Notes Discret. Math. 49: 661-666 (2015) - [j10]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. J. Graph Theory 79(2): 86-102 (2015) - [c1]Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu:
Large Supports are Required for Well-Supported Nash Equilibria. APPROX-RANDOM 2015: 78-84 - [i4]Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu:
Large Supports are required for Well-Supported Nash Equilibria. CoRR abs/1504.03602 (2015) - 2014
- [i3]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval minors of complete bipartite graphs. CoRR abs/1408.1155 (2014) - 2013
- [j9]Jonathan A. Noel, Bruce A. Reed, Douglas B. West, Hehui Wu, Xuding Zhu:
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. Electron. Notes Discret. Math. 43: 89-95 (2013) - [j8]Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu:
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. J. Graph Theory 74(4): 369-391 (2013) - [i2]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. CoRR abs/1308.6739 (2013) - 2012
- [j7]Douglas B. West, Hehui Wu:
Packing of Steiner trees and S-connectors in graphs. J. Comb. Theory B 102(1): 186-205 (2012) - [i1]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. CoRR abs/1211.1999 (2012) - 2011
- [j6]József Balogh, John Lenz, Hehui Wu:
Complete minors, independent sets, and chordal graphs. Discuss. Math. Graph Theory 31(4): 639-674 (2011) - [j5]Suil O, Douglas B. West, Hehui Wu:
Longest cycles in k-connected graphs with given independence number. J. Comb. Theory B 101(6): 480-485 (2011)
2000 – 2009
- 2009
- [j4]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
On mod (2p+1)-orientations of graphs. J. Comb. Theory B 99(2): 399-406 (2009) - 2008
- [j3]David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu:
Optimal strong parity edge-coloring of complete graphs. Comb. 28(6): 625-632 (2008) - [j2]Tracy Grauman, Stephen G. Hartke, Adam S. Jobson, William B. Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu:
The hub number of a graph. Inf. Process. Lett. 108(4): 226-228 (2008) - 2006
- [j1]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Comb. Theory B 96(4): 571-576 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
