Hehui Wu

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Partitioning graphs with linear minimum degree	2024	Jie Ma Hehui Wu
+ PDF Chat	The inducibility of oriented stars	2024	Ping Hu Jie Ma Sergey Norin Hehui Wu
+ PDF Chat	Graph partitions under average degree constraint	2023	Yan Wang Hehui Wu
+	The total Betti number of the independence complex of ternary graphs	2023	Wentao Zhang Hehui Wu
+ PDF Chat	Proper orientations and proper chromatic number	2023	Yaobin Chen Bojan Mohar Hehui Wu
+	Partitioning graphs with linear minimum degree	2023	Jie Ma Hehui Wu
+ PDF Chat	Subgraphs of Kneser graphs with large girth and large chromatic number	2022	Bojan Mohar Hehui Wu
+ PDF Chat	On the Turán Number of the Linear $3$-Graph $C_{13}$	2022	Chaoliang Tang Hehui Wu Shengtong Zhang Zeyu Zheng
+	Graph Partitions Under Average Degree Constraint	2022	Yan Wang Hehui Wu
+	List-avoiding orientations	2022	Peter Bradshaw Yaobin Chen Hao Ma Bojan Mohar Hehui Wu
+ PDF Chat	Triangle-free subgraphs with large fractional chromatic number	2021	Bojan Mohar Hehui Wu
+	Note on the Turán number of the $3$-linear hypergraph $C_{13}$	2021	Chao-Liang Tang Hehui Wu Shengtong Zhang Zeyu Zheng
+	Proper orientations and proper chromatic number	2021	Yaobin Chen Bojan Mohar Hehui Wu
+ PDF Chat	Word-representability of split graphs	2021	Sergey Kitaev Yangjing Long Jun Ma Hehui Wu
+ PDF Chat	1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio	2020	Zdeněk Dvořák Patrice Ossona de Mendez Hehui Wu
+ PDF Chat	Fractional chromatic number of a random subgraph	2020	Bojan Mohar Hehui Wu
+	The inducibility of oriented stars	2020	Ping Hu Jie Ma Sergey Norin Hehui Wu
+	A Ramsey Type problem for highly connected subgraphs	2020	Chunlok Lo Hehui Wu Qiqin Xie
+	The Betti Number of the Independence Complex of Ternary Graphs	2020	Hehui Wu Wentao Zhang
+	Coloring tournaments: From local to global	2019	Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé Hehui Wu
+	Fractional chromatic number of a random subgraph	2018	Bojan Mohar Hehui Wu
+	1-subdivisions, fractional chromatic number and Hall ratio	2018	Zdeněk Dvořák Patrice Ossona de Mendez Hehui Wu
+	Triangle-free subgraphs with large fractional chromatic number	2018	Bojan Mohar Hehui Wu
+ PDF Chat	The extremal function for disconnected minors	2017	Endre Csóka Irene Lo Sergey Norin Hehui Wu Liana Yepremyan
+	Word-representability of split graphs	2017	Sergey Kitaev Yangjing Long Jun Ma Hehui Wu
+	Coloring tournaments: from local to global	2017	Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé Hehui Wu
+	Weak duality for packing edge-disjoint odd (u, v)-trails	2016	Ross Churchley Bojan Mohar Hehui Wu
+ PDF Chat	DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER	2016	Bojan Mohar Hehui Wu
+ PDF Chat	Triangle-free subgraphs with large fractional chromatic number	2015	Bojan Mohar Hehui Wu
+	Dichromatic number and fractional chromatic number	2015	Bojan Mohar Hehui Wu
+	The extremal function for disconnected minors	2015	Endre Csóka Irene Lo Sergey Norin Hehui Wu Liana Yepremyan
+ PDF Chat	Interval Minors of Complete Bipartite Graphs	2015	Bojan Mohar Arash Rafiey B. Tayfeh‐Rezaie Hehui Wu
+	Large Supports are required for Well-Supported Nash Equilibria	2015	Yogesh Anbalagan Hao Huang Shachar Lovett Sergey Norin Adrian Vetta Hehui Wu
+	The extremal function for disconnected minors	2015	Endre Csóka Irene M.C. Lo Sergey Norin Hehui Wu Liana Yepremyan
+ PDF Chat	A Proof of a Conjecture of Ohba	2014	Jonathan A. Noel Bruce A. Reed Hehui Wu
+	Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>vertices	2014	Jonathan A. Noel Douglas B. West Hehui Wu Xuding Zhu
+	Interval minors of complete bipartite graphs	2014	Bojan Mohar Arash Rafiey B. Tayfeh‐Rezaie Hehui Wu
+ PDF Chat	Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond	2013	Jonathan A. Noel Bruce A. Reed Douglas B. West Hehui Wu Xuding Zhu
+	Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree	2013	Seog‐Jin Kim Alexandr Kostochka Douglas B. West Hehui Wu Xuding Zhu
+	Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices	2013	Jonathan A. Noel Douglas B. West Hehui Wu Xuding Zhu
+	A Proof of a Conjecture of Ohba	2012	Jonathan A. Noel Bruce A. Reed Hehui Wu
+	A Proof of a Conjecture of Ohba	2012	Jonathan A. Noel Bruce A. Reed Hehui Wu
+	Extremal problems on cycles, packing, and decomposition of graphs	2011	Hehui Wu
+	Longest cycles in k-connected graphs with given independence number	2011	O Suil Douglas B. West Hehui Wu
+ PDF Chat	Complete minors, independent sets, and chordal graphs	2011	József Balogh John Lenz Hehui Wu
+	Complete Minors, Independent Sets, and Chordal Graphs	2009	József Balogh John Lenz Hehui Wu
+ PDF Chat	Optimal strong parity edge-coloring of complete graphs	2008	David P. Bunde Kevin G. Milans Douglas B. West Hehui Wu
+	On mod <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>p</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-orientations of graphs	2008	Hong‐Jian Lai Yehong Shao Hehui Wu Ju Zhou
+	Complete Minors, Independent Sets, and Chordal	2008	John Lenz Hehui Wu
+	Parity Edge-Coloring of Graphs	2006	David P. Bunde Kevin G. Milans Douglas B. West Hehui Wu
+ PDF Chat	Every 3-connected, essentially 11-connected line graph is Hamiltonian	2005	Hong‐Jian Lai Yehong Shao Hehui Wu Ju Zhou
+ PDF Chat	Every $3$-connected, essentially $11$-connected line graph is hamiltonian	2005	Hong‐Jian Lai Yehong Shao Ju Zhou Hehui Wu
+	Hamiltonian claw-free graphs	2005	Hong‐Jian Lai Yehong Shao Ju Zhou Hehui Wu

Common Coauthors

Coauthor	Papers Together
Bojan Mohar	14
Douglas B. West	7
Jonathan A. Noel	6
Sergey Norin	6
Bruce A. Reed	4
Ju Zhou	4
Hong‐Jian Lai	4
Jie Ma	4
Xuding Zhu	4
Yehong Shao	4
Yaobin Chen	3
Liana Yepremyan	3
John Lenz	3
Endre Csóka	3
Stéphan Thomassé	2
Irene Lo	2
Shengtong Zhang	2
Patrice Ossona de Mendez	2
Kevin G. Milans	2
József Balogh	2
Zdeněk Dvořák	2
Zeyu Zheng	2
Yangjing Long	2
Arash Rafiey	2
Tien-Nam Le	2
Sergey Kitaev	2
Ararat Harutyunyan	2
Ping Hu	2
B. Tayfeh‐Rezaie	2
Chao-Liang Tang	1
David P. Bunde	1
Seog‐Jin Kim	1
Chaoliang Tang	1
Irene M.C. Lo	1
Adrian Vetta	1
Chunlok Lo	1
Hao Huang	1
Shachar Lovett	1
O Suil	1
Yogesh Anbalagan	1
Qiqin Xie	1
Peter Bradshaw	1
Alexandr Kostochka	1
Yan Wang	1
Jun Ma	1
Hao Ma	1
Wentao Zhang	1
Wentao Zhang	1
Jun Ma	1
Yan Wang	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Kneser's conjecture, chromatic number, and homotopy	1978	László Lovász	6
+	Ohba’s conjecture is true for graphs with independence number at most three	2009	Yufa Shen Wenjie He Guoping Zheng LI Yan-po	5
+	None	2002		5
+ PDF Chat	Restricted colorings of graphs	1993	Noga Alon	4
+ PDF Chat	DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER	2016	Bojan Mohar Hehui Wu	4
+	Two results on the digraph chromatic number	2012	Ararat Harutyunyan Bojan Mohar	4
+	The dichromatic number of a digraph	1982	V. Neumann‐Lara	4
+	List Colouring When The Chromatic Number Is Close To the Order Of The Graph	2004	Bruce Reed Benny Sudakov	4
+	On the choosability of complete multipartite graphs with part size three	2000	H. A. Kierstead	4
+	A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs	1952	G. A. Dirac	3
+	Dense Graphs without 3-Regular Subgraphs	1995	L. Pyber V. Rödl Endre Szemerédi	3
+	Asymptotically Good List-Colorings	1996	Jeff Kahn	3
+	List colourings of graphs	2001	Douglas R. Woodall	3
+ PDF Chat	On Eulerian and Hamiltonian Graphs and Line Graphs	1965	Frank Harary C. St. J. A. Nash‐Williams	3
+	Supereulerian graphs: A survey	1992	Paul A. Catlin	3
+ PDF Chat	Graph Theory and Probability	1959	Paul Erdős	3
+ PDF Chat	The Erdös–Hajnal Conjecture—A Survey	2013	Maria Chudnovsky	3
+	List Colouring of Graphs with at Most (2 — o(l)) x Vertices	2002	Bruce Reed Benny Sudakov	3
+	On chromatic‐choosable graphs	2002	Kyoji Ohba	3
+	None	2007		3
+ PDF Chat	Uniquely Colourable Graphs with Large Girth	1976	Béla Bollobás Norbert Sauer	3
+	Tournaments and colouring	2012	Eli Berger Krzysztof Choromański Maria Chudnovsky Jacob Fox Martin Loebl Alex Scott Paul Seymour Stéphan Thomassé	3
+	On the degrees of the vertices of a directed graph	1965	S. L. Hakimi	3
+	List Edge and List Total Colourings of Multigraphs	1997	O. V. Borodin Alexandr Kostochka Douglas R. Woodall	3
+	None	2004	Dan Archdeacon Joanna A. Ellis-Monaghan David Fisher Dalibor Fronček P. C. B. Lam Suzanne M. Seager Bing Wei Raphael Yuster	3
+	Choice Numbers of Graphs: a Probabilistic Approach	1992	Noga Alon	3
+	Reflections on graph theory	1986	Carsten Thomassen	3
+	Some upper bounds on the total and list chromatic numbers of multigraphs	1992	Roland Häggkvist Amanda G. Chetwynd	3
+	None	2006	Béla Bollobás Graham Brightwell	3
+	Über eine Eigenschaft der ebenen Komplexe	1937	Klaus W. Wagner	3
+	Ohba’s conjecture for graphs with independence number five	2011	Alexandr Kostochka Michael Stiebitz Douglas R. Woodall	3
+	On a Closure Concept in Claw-Free Graphs	1997	Zdeněk Ryjáček	3
+ PDF Chat	Independent sets in graphs with an excluded clique minor	2007	David R. Wood	3
+	Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture	2005	Ken‐ichi Kawarabayashi Michael D. Plummer Bjarne Toft	3
+	Decomposing graphs under degree constraints	1996	Michael Stiebitz	3
+	Graphs whose choice number is equal to their chromatic number	1998	Sylvain Gravier Frédéric Maffray	3
+ PDF Chat	On a special case of Hadwiger's conjecture	2003	Michael D. Plummer Michael Stiebitz Bjarne Toft	3
+	None	2010	Wensong Lin Daphne Der-Fen Liu Xuding Zhu	3
+	Subcontraction-equivalence and Hadwiger's conjecture	1987	Douglas R. Woodall	2
+	Edge-Disjoint Spanning Trees of Finite Graphs	1961	C. St. J. A. Nash‐Williams	2
+	Near-optimal list colorings	2000	Michael Molloy Bruce Reed	2
+	Choice number of 3-colorable elementary graphs	1997	Sylvain Gravier Frédéric Maffray	2
+	Stanley-Wilf limits are typically exponential	2013	Jacob Fox	2
+ PDF Chat	A Combinatorial Classic — Sparse Graphs with High Chromatic Number	2013	Jaroslav Nešetřil	2
+	A note on list-coloring powers of graphs	2014	Nicholas Kosar Šárka Petříčková Benjamin Reiniger Elyse Yeager	2
+ PDF Chat	Grad and classes with bounded expansion I. Decompositions	2007	Jaroslav Nešetřil Patrice Ossona de Mendez	2
+	The inducibility of graphs	1975	Nicholas Pippenger Martin Charles Golumbic	2
+	Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs	1984	Manton M. Matthews David P. Sumner	2
+	Gallai's Theorem for List Coloring of Digraphs	2011	Ararat Harutyunyan Bojan Mohar	2
+	Strengthened Brooks Theorem for digraphs of girth three	2011	Ararat Harutyunyan Bojan Mohar	2