Bruce A. Reed

Generating author description...

All published works

Action	Title	Year	Authors
+	Almost all string graphs are intersection graphs of plane convex sets	2018	János Pach Bruce A. Reed Yelena Yuditsky
+	A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω	2015	Andrew D. King Bruce A. Reed
+	Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time	2015	Ken‐ichi Kawarabayashi Zhentao Li Bruce A. Reed
+ PDF Chat	A Proof of a Conjecture of Ohba	2014	Jonathan A. Noel Bruce A. Reed 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
+	Claw-free graphs, skeletal graphs, and a stronger conjecture on $\omega$, $\Delta$, and $\chi$	2012	Andrew D. King Bruce A. Reed
+	A Proof of a Conjecture of Ohba	2012	Jonathan A. Noel Bruce A. Reed Hehui Wu
+	A short proof that $\chi$ can be bounded $\epsilon$ away from $\Delta+1$ towards $\omega$	2012	Andrew D. King Bruce A. Reed
+	A Proof of a Conjecture of Ohba	2012	Jonathan A. Noel Bruce A. Reed Hehui Wu
+	A short proof that $χ$ can be bounded $ε$ away from $Δ+1$ towards $ω$	2012	Andrew D. King Bruce A. Reed
+	Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$	2012	Andrew D. King Bruce A. Reed
+	Polynomial treewidth forces a large grid-like-minor	2011	Bruce A. Reed David R. Wood
+	A Characterization of Graphs with Fractional Total Chromatic Number Equal to	2009	Takehiro Ito W. Sean Kennedy Bruce A. Reed
+	Ballot Theorems, Old and New	2008	Louigi Addario‐Berry Bruce A. Reed
+	Tree-width of graphs without a 3×3 grid minor	2008	Étienne Birmelé J. A. Bondy Bruce A. Reed
+	The evolution of the mixing rate of a simple random walk on the giant component of a random graph	2008	Nikolaos Fountoulakis Bruce A. Reed
+	A general ballot theorem	2008	Louigi Addario‐Berry Bruce A. Reed
+	Ballot theorems for random walks with finite variance	2008	Louigi Addario‐Berry Bruce A. Reed
+ PDF Chat	Faster Mixing and Small Bottlenecks	2006	Nikolaos Fountoulakis Bruce A. Reed
+	An upper bound for the chromatic number of line graphs	2005	Andrew D. King Bruce A. Reed Adrian Vetta
+	Stable skew partition problem	2004	Simone Dantas Celina M.H. de Figueiredo Sulamita Klein Sylvain Gravier Bruce A. Reed
+	Polynomial time recognition of P4-structure	2002	Ryan Hayward Stefan Hougardy Bruce A. Reed
+	A note on vertex orders for stability number	1999	N. V. R. Mahadev Bruce A. Reed
+	A note on vertex orders for stability number	1999	N. V. R. Mahadev Bruce A. Reed
+	The gallai-younger conjecture for planar graphs	1996	Bruce A. Reed F. Bruce Shepherd
+	When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem	1992	Alan Frieze Richard M. Karp Bruce A. Reed
+	A note on even pairs	1987	Bruce A. Reed

Common Coauthors

Coauthor	Papers Together
Andrew D. King	6
Jonathan A. Noel	4
Hehui Wu	4
Louigi Addario‐Berry	3
N. V. R. Mahadev	2
Nikolaos Fountoulakis	2
János Pach	1
Celina M. H. de Figueiredo	1
Simone Dantas	1
F. Bruce Shepherd	1
W. Sean Kennedy	1
Alan Frieze	1
Sylvain Gravier	1
Étienne Birmelé	1
Sulamita Klein	1
David R. Wood	1
Richard M. Karp	1
Yelena Yuditsky	1
Stefan Hougardy	1
Zhentao Li	1
Takehiro Ito	1
J. A. Bondy	1
Ken‐ichi Kawarabayashi	1
Douglas B. West	1
Xuding Zhu	1
Adrian Vetta	1
Ryan Hayward	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Hitting all maximum cliques with a stable set using lopsided independent transversals	2010	Andrew D. King	3
+ PDF Chat	Ballot Theorems and Sojourn Laws for Stationary Processes	1999	Olav Kallenberg	3
+	List Edge and List Total Colourings of Multigraphs	1997	O. V. Borodin Alexandr Kostochka Douglas R. Woodall	3
+	Some upper bounds on the total and list chromatic numbers of multigraphs	1992	Roland Häggkvist Amanda G. Chetwynd	3
+ PDF Chat	ON LOCAL AND RATIO LIMIT THEOREMS	1967	Charles J. Stone	3
+	Graphs whose choice number is equal to their chromatic number	1998	Sylvain Gravier Frédéric Maffray	3
+ PDF Chat	An upper bound for the chromatic number of line graphs	2005	Andrew D. King Bruce Reed Adrian Vetta	3
+	A Combinatorial Lemma and its Application to Probability Theory	1991	Frank Spitzer	3
+	Asymptotically Good List-Colorings	1996	Jeff Kahn	3
+	A Note On Reed's Conjecture	2008	Landon Rabern	3
+	Fluctuations in the ratio of scores in counting a ballot	1964	Lajos Takács	3
+	Ohba’s conjecture is true for graphs with independence number at most three	2009	Yufa Shen Wenjie He Guoping Zheng LI Yan-po	3
+	None	2002		3
+	Combinatorial methods in the theory of dams	1964	Lajos Takács	3
+	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	2
+	None	2008		2
+ PDF Chat	A Theorem on <i>k</i>-Saturated Graphs	1965	A. Hajnal	2
+	On chromatic‐choosable graphs	2002	Kyoji Ohba	2
+ PDF Chat	Restricted colorings of graphs	1993	Noga Alon	2
+	On the choosability of complete multipartite graphs with part size three	2000	H. A. Kierstead	2
+	Chromatic-choosability of the power of graphs	2013	Seog‐Jin Kim Young Soo Kwon Boram Park	2
+	List-colourings of graphs	1985	B Bollobás A. J. Harris	2
+ PDF Chat	A Superlocal Version of Reed's Conjecture	2014	Katherine Edwards Andrew D. King	2
+	List Colouring of Graphs with at Most (2 — o(l)) x Vertices	2002	Bruce Reed Benny Sudakov	2
+	A note on list-coloring powers of graphs	2014	Nicholas Kosar Šárka Petříčková Benjamin Reiniger Elyse Yeager	2
+	List colourings of graphs	2001	Douglas R. Woodall	2
+ PDF Chat	A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs	2013	Maria Chudnovsky Andrew D. King Matthieu Plumettaz Paul Seymour	2
+	List Colouring When The Chromatic Number Is Close To the Order Of The Graph	2004	Bruce Reed Benny Sudakov	2
+	A condition for matchability in hypergraphs	1995	Penny Haxell	2
+	Ohba’s conjecture for graphs with independence number five	2011	Alexandr Kostochka Michael Stiebitz Douglas R. Woodall	2
+	SOME UNSOLVED PROBLEMS IN GRAPH THEORY	1968	V. G. Vizing	2
+	Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved	1988	Mark Jerrum Alistair Sinclair	2
+	Choice number of 3-colorable elementary graphs	1997	Sylvain Gravier Frédéric Maffray	2
+	Near-optimal list colorings	2000	Michael Molloy Bruce Reed	2
+ PDF Chat	On the mixing time of a simple random walk on the super critical percolation cluster	2003	Itaı Benjamini Elchanan Mossel	2
+ PDF Chat	The 1971 Rietz Lecture Sums of Independent Random Variables--Without Moment Conditions	1972	Harry Kesten	2
+	Independent systems of representatives in weighted graphs	2007	Ron Aharoni Eli Berger Ziv Ran	2
+	An inequality for the chromatic number of a graph	1968	G Szekeres Herbert S. Wilf	2
+ PDF Chat	On hitting all maximum cliques with an independent set	2010	Landon Rabern	2
+	Graduate Texts in Mathematics	1977	Rajendra Bhatia Glen Bredon Wolfgang Walter Joseph Rotman M. Ram Murty Jane Gilman Peter Walters Martin Golubitsky Ioannis Karatzas Henri Cohen	2
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	1
+	Independent transversals in r-partite graphs	1997	Raphael Yuster	1
+ PDF Chat	Independent Transversals and Independent Coverings in Sparse Partite Graphs	1997	Raphael Yuster	1
+	Towards on-line Ohba's conjecture	2011	Jakub Kozik Piotr Micek Xuding Zhu	1
+ PDF Chat	Some Inequalities for Reversible Markov Chains	1982	David Aldous	1
+	On stable cutsets in graphs	2000	Andreas Brandstädt Feodor F. Dragan Van Bang Lê Thomas Szymczak	1
+	ω, Δ, and χ	1998	Bruce Reed	1
+	Polynomial-Time Approximation Algorithms for the Ising Model	1993	Mark Jerrum Alistair Sinclair	1
+	Towards an on-line version of Ohba’s conjecture	2013	Jakub Kozik Piotr Micek Xuding Zhu	1
+	Homomorphieeigenschaften und mittlere Kantendichte von Graphen	1967	W. Mader	1