A note on the semi-strong perfect graph conjecture. - Bruce A. Reed (Discret. Math., 1985)

A note on short cycles in diagraphs. - Chính T. Hoàng; Bruce A. Reed (Discret. Math., 1987)

A note on even pairs. - Bruce A. Reed (Discret. Math., 1987)

A semi-strong Perfect Graph theorem. - Bruce A. Reed (J. Comb. Theory B, 1987)

Edge-colouring random graphs. - Alan M. Frieze; Bill Jackson; Colin J. H. McDiarmid; Bruce A. Reed (J. Comb. Theory B, 1988)

Threshold tolerance graphs. - Clyde L. Monma; Bruce A. Reed; William T. Trotter (J. Graph Theory, 1988)

P4-comparability graphs. - Chính T. Hoàng; Bruce A. Reed (Discret. Math., 1989)

Building Heaps Fast. - Colin McDiarmid; Bruce A. Reed (J. Algorithms, 1989)

Some classes of perfectly orderable graphs. - Chính T. Hoàng; Bruce A. Reed (J. Graph Theory, 1989)

Perfection, Parity, Planarity, and Packing Paths. - Bruce A. Reed (IPCO, 1990)

Linear Arboricity of Random Regular Graphs. - Colin McDiarmid; Bruce A. Reed (Random Struct. Algorithms, 1990)

Greedy Matching on the Line. - Alan M. Frieze; Colin McDiarmid; Bruce A. Reed (SIAM J. Comput., 1990)

An extremal function for the achromatic number. - Béla Bollobás; Bruce A. Reed; Andrew Thomason 001 (Graph Structure Theory, 1991)

Counterexamples to a conjecture of Las Vergnas and Meyniel. - Bruce A. Reed (Graph Structure Theory, 1991)

Finding disjoint trees in planar graphs in linear time. - Bruce A. Reed; Neil Robertson 001; Alexander Schrijver; Paul D. Seymour (Graph Structure Theory, 1991)

Acyclic Coloring of Graphs. - Noga Alon; Colin McDiarmid; Bruce A. Reed (Random Struct. Algorithms, 1991)

Mick Gets Some (the Odds Are on His Side) - Vasek Chvátal; Bruce A. Reed (FOCS, 1992)

Finding Approximate Separators and Computing Tree Width Quickly - Bruce A. Reed (STOC, 1992)

Non-Interfering Network Flows. - Colin McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (SWAT, 1992)

Star arboricity. - Noga Alon; Colin McDiarmid; Bruce A. Reed (Comb., 1992)

The Strongly Connected Components of 1-in, 1-out. - Bruce A. Reed; Colin McDiarmid (Comb. Probab. Comput., 1992)

Fractionally colouring total graphs. - Kyriakos Kilakos; Bruce A. Reed (Comb., 1993)

Polychromatic Hamilton cycles. - Alan M. Frieze; Bruce A. Reed (Discret. Math., 1993)

Complete Multi-partite Cutsets in Minimal Imperfect Graphs. - Gérard Cornuéjols; Bruce A. Reed (J. Comb. Theory B, 1993)

On Total Colorings of Graphs. - Colin J. H. McDiarmid; Bruce A. Reed (J. Comb. Theory B, 1993)

Induced Circuits in Planar Graphs. - Colin J. H. McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (J. Comb. Theory B, 1994)

Covering the Edges of a Random Graph by Cliques. - Alan M. Frieze; Bruce A. Reed (Comb., 1995)

Multicoloured Hamilton Cycles. - Michael H. Albert; Alan M. Frieze; Bruce A. Reed (Electron. J. Comb., 1995)

Almost Every Graph can be Covered by [fracDelta2] Linear Forests. - Colin McDiarmid; Bruce A. Reed (Comb. Probab. Comput., 1995)

Rooted Routing in the Plane. - Bruce A. Reed (Discret. Appl. Math., 1995)

Right angle free subsets in the plane. - B. Gamble; William R. Pulleyblank; Bruce A. Reed; F. Bruce Shepherd (Graphs Comb., 1995)

Recognizing bull-free perfect graphs. - Bruce A. Reed; Najiba Sbihi (Graphs Comb., 1995)

The Dominating Number of Random Cubic Graph. - Michael Molloy 001; Bruce A. Reed (Random Struct. Algorithms, 1995)

A Critical Point for Random Graphs with a Given Degree Sequence. - Michael Molloy 001; Bruce A. Reed (Random Struct. Algorithms, 1995)

On the Variance of the Height of Random Binary Search Trees. - Luc Devroye; Bruce A. Reed (SIAM J. Comput., 1995)

When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? - Alan M. Frieze; Richard M. Karp; Bruce A. Reed (SIAM J. Comput., 1995)

Packing Directed Circuits. - Bruce A. Reed; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Comb., 1996)

The Gallai-Younger Conjecture for Planar Graphs. - Bruce A. Reed; F. Bruce Shepherd (Comb., 1996)

Perfect Matchings in Random r-regular, s-uniform Hypergraphs. - Colin Cooper; Alan M. Frieze; Michael Molloy 001; Bruce A. Reed (Comb. Probab. Comput., 1996)

Paths, Stars and the Number Three. - Bruce A. Reed (Comb. Probab. Comput., 1996)

beta-Perfect Graphs. - S. E. Markossian; G. S. Gasparian; Bruce A. Reed (J. Comb. Theory B, 1996)

On the mixing rate of the triangulation walk. - Michael S. O. Molloy; Bruce A. Reed; William Steiger (Randomization Methods in Algorithm Design, 1997)

Colouring a Graph Frugally. - Hugh Hind; Michael Molloy 001; Bruce A. Reed (Comb., 1997)

An Algorithm for Finding Homogeneous Pairs. - Hazel Everett; Sulamita Klein; Bruce A. Reed (Discret. Appl. Math., 1997)

Path parity and perfection. - Hazel Everett; Celina M. H. de Figueiredo; Cláudia Linhares Sales; Frédéric Maffray; Oscar Porto; Bruce A. Reed (Discret. Math., 1997)

Edge coloring regular graphs of high degree. - Ljubomir Perkovic; Bruce A. Reed (Discret. Math., 1997)

On Planar Perfectly Contractile Graphs. - Cláudia Linhares Sales; Frédéric Maffray; Bruce A. Reed (Graphs Comb., 1997)

A Bound on the Strong Chromatic Index of a Graph, . - Michael Molloy 001; Bruce A. Reed (J. Comb. Theory B, 1997)

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (IPCO, 1998)

Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. - Michael Molloy 001; Bruce A. Reed (LATIN, 1998)

Further Algorithmic Aspects of the Local Lemma. - Michael Molloy 001; Bruce A. Reed (STOC, 1998)

A Bound on the Total Chromatic Number. - Michael Molloy 001; Bruce A. Reed (Comb., 1998)

The Size of the Giant Component of a Random Graph with a Given Degree Sequence. - Michael Molloy 001; Bruce A. Reed (Comb. Probab. Comput., 1998)

Fractional Colouring and Hadwiger's Conjecture. - Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 1998)

ω, Δ, and χ. - Bruce A. Reed (J. Graph Theory, 1998)

Total Coloring With Delta + (log Delta) Colors. - Hugh Hind; Michael Molloy 001; Bruce A. Reed (SIAM J. Comput., 1998)

Mangoes and Blueberries. - Bruce A. Reed (Comb., 1999)

Critical Subgraphs of a Random Graph. - Michael Molloy 001; Bruce A. Reed (Electron. J. Comb., 1999)

Colouring proximity graphs in the plane. - Colin McDiarmid; Bruce A. Reed (Discret. Math., 1999)

Introducing Directed Tree Width. - Bruce A. Reed (Electron. Notes Discret. Math., 1999)

A Description of Claw-Free Perfect Graphs. - Frédéric Maffray; Bruce A. Reed (J. Comb. Theory B, 1999)

A Strengthening of Brooks' Theorem. - Bruce A. Reed (J. Comb. Theory B, 1999)

A note on vertex orders for stability number. - Nadimpalli V. R. Mahadev; Bruce A. Reed (J. Graph Theory, 1999)

The list colouring constants. - Bruce A. Reed (J. Graph Theory, 1999)

Edge coloring nearly bipartite graphs. - Bruce A. Reed (Oper. Res. Lett., 1999)

Polynomial Time Recognition of Clique-Width le leq 3 Graphs (Extended Abstract). - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (LATIN, 2000)

How tall is a tree? - Bruce A. Reed (STOC, 2000)

Optimal packings of edge-disjoint odd cycles. - Claude Berge; Bruce A. Reed (Discret. Math., 2000)

k-Colouring when k is close to Delta. - Michael Molloy 001; Bruce A. Reed (Electron. Notes Discret. Math., 2000)

An Improved Algorithm for Finding Tree Decompositions of Small Width. - Ljubomir Perkovic; Bruce A. Reed (Int. J. Found. Comput. Sci., 2000)

Finding Skew Partitions Efficiently. - Celina M. H. de Figueiredo; Sulamita Klein; Yoshiharu Kohayakawa; Bruce A. Reed (J. Algorithms, 2000)

Clique Minors in Graphs and Their Complements. - Bruce A. Reed; Robin Thomas 001 (J. Comb. Theory B, 2000)

Channel assignment and weighted coloring. - Colin McDiarmid; Bruce A. Reed (Networks, 2000)

Near-optimal list colorings. - Michael Molloy 001; Bruce A. Reed (Random Struct. Algorithms, 2000)

Approximately covering by cycles in planar graphs. - Dieter Rautenbach; Bruce A. Reed (SODA, 2001)

Colouring graphs when the number of colours is nearly the maximum degree. - Michael Molloy 001; Bruce A. Reed (STOC, 2001)

The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. - Dieter Rautenbach; Bruce A. Reed (Comb., 2001)

Bull-Reducible Berge Graphs are Perfect. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (Electron. Notes Discret. Math., 2001)

A note on Random Homomorphism from ArbitraryGraphs to Z. - Martin Loebl; Jaroslav Nesetril; Bruce A. Reed (Electron. Notes Discret. Math., 2001)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. - Colin McDiarmid; Bruce A. Reed (Electron. Notes Discret. Math., 2001)

Recognizing Planar Strict Quasi-Parity Graphs. - Cláudia Linhares Sales; Frédéric Maffray; Bruce A. Reed (Graphs Comb., 2001)

Polynomial time recognition of P4-structure. - Ryan B. Hayward; Stefan Hougardy; Bruce A. Reed (SODA, 2002)

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. - Colin Cooper; Alan M. Frieze; Bruce A. Reed (Comb. Probab. Comput., 2002)

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. - Colin Cooper; Alan M. Frieze; Bruce A. Reed; Oliver Riordan (Comb. Probab. Comput., 2002)

Asymptotically the List Colouring Constants Are 1. - Bruce A. Reed; Benny Sudakov (J. Comb. Theory B, 2002)

A note on random homomorphism from arbitrary graphs to Z. - Martin Loebl; Jaroslav Nesetril; Bruce A. Reed (Discret. Math., 2003)

Channel assignment on graphs of bounded treewidth. - Colin McDiarmid; Bruce A. Reed (Discret. Math., 2003)

The height of a random binary search tree. - Bruce A. Reed (J. ACM, 2003)

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (J. Algorithms, 2003)

List Colouring When The Chromatic Number Is Close To the Order Of The Graph. - Bruce A. Reed; Benny Sudakov (Comb., 2004)

Stable skew partition problem. - Simone Dantas; Celina M. H. de Figueiredo; Sulamita Klein; Sylvain Gravier; Bruce A. Reed (Discret. Appl. Math., 2004)

Preface. - Bruce A. Reed; Siang W. Song; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2004)

Hadwiger's conjecture for line graphs. - Bruce A. Reed; Paul D. Seymour (Eur. J. Comb., 2004)

Excluding any graph as a minor allows a low tree-width 2-coloring. - Matt DeVos; Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Bruce A. Reed; Paul D. Seymour; Dirk Vertigan (J. Comb. Theory B, 2004)

Star coloring of graphs. - Guillaume Fertin; André Raspaud; Bruce A. Reed (J. Graph Theory, 2004)

Finding odd cycle transversals. - Bruce A. Reed; Kaleigh Smith; Adrian Vetta (Oper. Res. Lett., 2004)

On the Co-P3-Structure of Perfect Graphs. - Chính T. Hoàng; Bruce A. Reed (SIAM J. Discret. Math., 2004)

Heap Building Bounds. - Zhentao Li; Bruce A. Reed (WADS, 2005)

The perfection and recognition of bull-reducible Berge graphs. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (RAIRO Theor. Informatics Appl., 2005)

Vertex colouring edge partitions. - Louigi Addario-Berry; Robert E. L. Aldred; Ketan Dalal; Bruce A. Reed (J. Comb. Theory B, 2005)

(Delta-k)-critical graphs. - Babak Farzad; Michael S. O. Molloy; Bruce A. Reed (J. Comb. Theory B, 2005)

On the fractional chromatic index of a graph and its complement. - David Avis; Caterina De Simone; Bruce A. Reed (Oper. Res. Lett., 2005)

Concentration for self-bounding functions and an inequality of Talagrand. - Colin McDiarmid; Bruce A. Reed (Random Struct. Algorithms, 2006)

Properly 2-Colouring Linear Hypergraphs. - Arkadev Chattopadhyay; Bruce A. Reed (APPROX-RANDOM, 2007)

Fast Skew Partition Recognition. - William S. Kennedy; Bruce A. Reed (KyotoCGGT, 2007)

Domination in Cubic Graphs of Large Girth. - Dieter Rautenbach; Bruce A. Reed (KyotoCGGT, 2007)

Computing crossing number in linear time. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2007)

Vertex-Colouring Edge-Weightings. - Louigi Addario-Berry; Ketan Dalal; Colin McDiarmid; Bruce A. Reed; Andrew Thomason 001 (Comb., 2007)

The Erdös-Pósa Property For Long Circuits. - Etienne Birmelé; J. Adrian Bondy; Bruce A. Reed (Comb., 2007)

An upper bound for the chromatic number of line graphs. - Andrew D. King; Bruce A. Reed; Adrian Vetta (Eur. J. Comb., 2007)

List Colouring Squares of Planar Graphs. - Frédéric Havet; Jan van den Heuvel; Colin McDiarmid; Bruce A. Reed (Electron. Notes Discret. Math., 2007)

Vašek Chvátal: A Very Short Introduction. - David Avis; J. Adrian Bondy; William J. Cook; Bruce A. Reed (Graphs Comb., 2007)

Approximate min-max relations for odd cycles in planar graphs. - Samuel Fiorini; Nadia Hardy; Bruce A. Reed; Adrian Vetta (Math. Program., 2007)

A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. - Ken-ichi Kawarabayashi; Bojan Mohar; Bruce A. Reed (FOCS, 2008)

Optimization and Recognition for K 5-minor Free Graphs in Linear Time. - Bruce A. Reed; Zhentao Li (LATIN, 2008)

L(2, 1)-labelling of graphs. - Frédéric Havet; Bruce A. Reed; Jean-Sébastien Sereni (SODA, 2008)

A nearly linear time algorithm for the half integral disjoint paths packing. - Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2008)

On the Maximum Degree of a Random Planar Graph. - Colin McDiarmid; Bruce A. Reed (Comb. Probab. Comput., 2008)

Degree constrained subgraphs. - Louigi Addario-Berry; Ketan Dalal; Bruce A. Reed (Discret. Appl. Math., 2008)

Partition into cliques for cubic graphs: Planar case, complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Carlos A. J. Martinhon; Fábio Protti; Bruce A. Reed (Discret. Appl. Math., 2008)

Planar graph bipartization in linear time. - Samuel Fiorini; Nadia Hardy; Bruce A. Reed; Adrian Vetta (Discret. Appl. Math., 2008)

Fractionally total colouring Gn, p. - Conor Meagher; Bruce A. Reed (Discret. Appl. Math., 2008)

Skew partitions in perfect graphs. - Bruce A. Reed (Discret. Appl. Math., 2008)

Fractional coloring and the odd Hadwiger's conjecture. - Ken-ichi Kawarabayashi; Bruce A. Reed (Eur. J. Comb., 2008)

List Colouring Constants of Triangle Free Graphs. - Omid Amini; Bruce A. Reed (Electron. Notes Discret. Math., 2008)

Bisimplicial vertices in even-hole-free graphs. - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2008)

A weaker version of Lovász' path removal conjecture. - Ken-ichi Kawarabayashi; Orlando Lee; Bruce A. Reed; Paul Wollan (J. Comb. Theory B, 2008)

Bounding chi in terms of omega and delta for quasi-line graphs. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2008)

The evolution of the mixing rate of a simple random walk on the giant component of a random graph. - Nikolaos Fountoulakis; Bruce A. Reed (Random Struct. Algorithms, 2008)

On Planar Quasi-Parity Graphs. - Cláudia Linhares Sales; Frédéric Maffray; Bruce A. Reed (SIAM J. Discret. Math., 2008)

A nearly linear time algorithm for the half integral parity disjoint paths packing problem. - Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2009)

Hadwiger's conjecture is decidable. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2009)

Highly parity linked graphs. - Ken-ichi Kawarabayashi; Bruce A. Reed (Comb., 2009)

Tree-width of graphs without a 3×3 grid minor. - Etienne Birmelé; J. Adrian Bondy; Bruce A. Reed (Discret. Appl. Math., 2009)

A general critical condition for the emergence of a giant component in random graphs with given degrees. - Nikolaos Fountoulakis; Bruce A. Reed (Electron. Notes Discret. Math., 2009)

A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. - Takehiro Ito; W. Sean Kennedy; Bruce A. Reed (Electron. Notes Discret. Math., 2009)

Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. - W. Sean Kennedy; Conor Meagher; Bruce A. Reed (Electron. Notes Discret. Math., 2009)

On the odd-minor variant of Hadwiger's conjecture. - Jim Geelen; Bert Gerards; Bruce A. Reed; Paul D. Seymour; Adrian Vetta (J. Comb. Theory B, 2009)

Removable cycles in non-bipartite graphs. - Ken-ichi Kawarabayashi; Bruce A. Reed; Orlando Lee (J. Comb. Theory B, 2009)

Critical random graphs and the structure of a minimum spanning tree. - Louigi Addario-Berry; Nicolas Broutin; Bruce A. Reed (Random Struct. Algorithms, 2009)

A linear-time algorithm to find a separator in a graph excluding a minor. - Bruce A. Reed; David R. Wood (ACM Trans. Algorithms, 2009)

Coloring Artemis graphs. - Benjamin Lévêque; Frédéric Maffray; Bruce A. Reed; Nicolas Trotignon (Theor. Comput. Sci., 2009)

A Separator Theorem in Minor-Closed Classes. - Ken-ichi Kawarabayashi; Bruce A. Reed (FOCS, 2010)

Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. - Ken-ichi Kawarabayashi; Zhentao Li; Bruce A. Reed (SODA, 2010)

An (almost) Linear Time Algorithm for Odd Cyles Transversal. - Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2010)

Odd cycle packing. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2010)

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. - Louigi Addario-Berry; W. Sean Kennedy; Andrew D. King; Zhentao Li; Bruce A. Reed (Discret. Appl. Math., 2010)

Asymptotically optimal frugal colouring. - Michael Molloy 001; Bruce A. Reed (J. Comb. Theory B, 2010)

Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. - Michael Molloy 001; Bruce A. Reed (J. Comb. Theory B, 2010)

The Graph Minor Algorithm with Parity Conditions. - Ken-ichi Kawarabayashi; Bruce A. Reed; Paul Wollan (FOCS, 2011)

Graph Coloring via The Probabilistic Method. - Bruce A. Reed (SODA, 2011)

The edge-density for K2, t minors. - Maria Chudnovsky; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2011)

A short proof that χ can be bounded ε away from Δ+1 towards ω - Andrew D. King; Bruce A. Reed (CoRR, 2012)

Connectivity for Bridge-Addable Monotone Graph Classes. - Louigi Addario-Berry; Colin McDiarmid; Bruce A. Reed (Comb. Probab. Comput., 2012)

Polynomial-time recognition of clique-width ≤3 graphs. - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (Discret. Appl. Math., 2012)

Polynomial treewidth forces a large grid-like-minor. - Bruce A. Reed; David R. Wood (Eur. J. Comb., 2012)

The disjoint paths problem in quadratic time. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001; Bruce A. Reed (J. Comb. Theory B, 2012)

Griggs and Yeh's Conjecture and L(p, 1)-labelings. - Frédéric Havet; Bruce A. Reed; Jean-Sébastien Sereni (SIAM J. Discret. Math., 2012)

A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. - Martin Grohe; Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2013)

Oriented trees in digraphs. - Louigi Addario-Berry; Frédéric Havet; Cláudia Linhares Sales; Bruce A. Reed; Stéphan Thomassé (Discret. Math., 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)

Asymptotics of the Chromatic Number for Quasi-Line Graphs. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2013)

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. - Vida Dujmovic; Daniel J. Harvey; Gwenaël Joret; Bruce A. Reed; David R. Wood (SIAM J. Discret. Math., 2013)

Digraph Girth via Chromatic Number. - Peter Keevash; Zhentao Li; Bojan Mohar; Bruce A. Reed (SIAM J. Discret. Math., 2013)

Removable paths and cycles with parity constraints. - Ken-ichi Kawarabayashi; Orlando Lee; Bruce A. Reed (J. Comb. Theory B, 2014)

Colouring graphs when the number of colours is almost the maximum degree. - Michael Molloy 001; Bruce A. Reed (J. Comb. Theory B, 2014)

For most graphs H, most H-free graphs have a linear homogeneous set. - Ross J. Kang; Colin McDiarmid; Bruce A. Reed; Alex D. Scott (Random Struct. Algorithms, 2014)

Connectivity Preserving Iterative Compression. - Bruce A. Reed (CCCG, 2015)

Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. - Ken-ichi Kawarabayashi; Zhentao Li; Bruce A. Reed (CoRR, 2015)

Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2015)

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

Excluding a Substar and an Antisubstar. - Maria Chudnovsky; Sergey Norin; Bruce A. Reed; Paul D. Seymour (SIAM J. Discret. Math., 2015)

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. - Felix Joos; Guillem Perarnau; Dieter Rautenbach; Bruce A. Reed (FOCS, 2016)

Forcing a sparse minor. - Bruce A. Reed; David R. Wood (Comb. Probab. Comput., 2016)

'Forcing a sparse minor' - CORRIGENDUM. - Bruce A. Reed; David R. Wood (Comb. Probab. Comput., 2016)

A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2016)

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. - Guillem Perarnau; Bruce A. Reed (Comb. Probab. Comput., 2017)

Acyclic edge colourings of graphs with large girth. - Xing Shi Cai; Guillem Perarnau; Bruce A. Reed; Adam Bene Watts (Random Struct. Algorithms, 2017)

Polyhedral results on the stable set problem in graphs containing even or odd pairs. - Jonas T. Witt; Marco E. Lübbecke; Bruce A. Reed (Math. Program., 2018)

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. - David Eppstein; Bruce A. Reed (SODA, 2019)

Near-domination in graphs. - Bruce A. Reed; Alex Scott 001; Paul D. Seymour (J. Comb. Theory A, 2019)

Notes on growing a tree in a graph. - Luc Devroye; Vida Dujmovic; Alan M. Frieze; Abbas Mehrabian; Pat Morin; Bruce A. Reed (Random Struct. Algorithms, 2019)

A Lower Bound on the Average Degree Forcing a Minor. - Sergey Norin; Bruce A. Reed; Andrew Thomason 001; David R. Wood (Electron. J. Comb., 2020)

Notes on Tree- and Path-chromatic Number. - Tony Huynh; Bruce A. Reed; David R. Wood; Liana Yepremyan (CoRR, 2020)

Almost All String Graphs are Intersection Graphs of Plane Convex Sets. - János Pach; Bruce A. Reed; Yelena Yuditsky (Discret. Comput. Geom., 2020)

Corrigendum to "Bisimplicial vertices in even-hole-free graphs". - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2020)

A variant of the Erdős-Sós conjecture. - Frédéric Havet; Bruce A. Reed; Maya Stein; David R. Wood (J. Graph Theory, 2020)

Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack. - Jordan Barrett; Salomon Bendayan; Yanjia Li; Bruce A. Reed (LAGOS, 2021)

The Speed and Threshold of the Biased Perfect Matching Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

The Speed and Threshold of the Biased Hamilton Cycle Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

Tight Bounds on the Clique Chromatic Number. - Gwenaël Joret; Piotr Micek; Bruce A. Reed; Michiel Smid (Electron. J. Comb., 2021)

Cops and robbers on oriented toroidal grids. - Sebastián González Hermosillo de la Maza; Seyyed Aliasghar Hosseini; Fiachra Knox; Bojan Mohar; Bruce A. Reed (Theor. Comput. Sci., 2021)

Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. - Bruce A. Reed; Maya Stein (J. Graph Theory, 2023)

Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. - Bruce A. Reed; Maya Stein (J. Graph Theory, 2023)

The speed and threshold of the biased perfect matching and Hamilton cycle games. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (Discret. Appl. Math., 2023)

Vertex Ranking of Degenerate Graphs. - John Iacono; Piotr Micek; Pat Morin; Bruce A. Reed (CoRR, 2024)