Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDBruce A. Reed
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j151]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. 857: 166-176 (2021)- 2020
- [j150]Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood:
A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. 27(2): P2.4 (2020) - [j149]János Pach, Bruce A. Reed, Yelena Yuditsky
:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63(4): 888-917 (2020) - [j148]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory, Ser. B 142: 374-375 (2020) - [j147]Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood:
A variant of the Erdős-Sós conjecture. J. Graph Theory 94(1): 131-158 (2020) - [i14]Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan:
Notes on Tree- and Path-chromatic Number. CoRR abs/2002.05363 (2020) - [i13]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020)
2010 – 2019
- 2019
- [j146]Bruce A. Reed, Alex Scott, Paul D. Seymour:
Near-domination in graphs. J. Comb. Theory, Ser. A 165: 392-407 (2019) - [j145]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [i12]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. CoRR abs/1904.10113 (2019) - 2018
- [c43]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG 2018: 68:1-68:14 - [i11]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost all string graphs are intersection graphs of plane convex sets. CoRR abs/1803.06710 (2018) - 2017
- [j144]Guillem Perarnau, Bruce A. Reed:
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. 26(3): 448-467 (2017) - [j143]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50(4): 511-533 (2017) - [i10]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - 2016
- [j142]Bruce A. Reed, David R. Wood:
Forcing a sparse minor. Comb. Probab. Comput. 25(2): 300-322 (2016) - [j141]Bruce A. Reed, David R. Wood:
'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. 25(2): 323 (2016) - [j140]Andrew D. King, Bruce A. Reed:
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. J. Graph Theory 81(1): 30-34 (2016) - [c42]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS 2016: 695-703 - [i9]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR abs/1601.03714 (2016) - 2015
- [j139]Andrew D. King, Bruce A. Reed:
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. J. Graph Theory 78(3): 157-194 (2015) - [j138]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. J. Graph Theory 79(2): 86-102 (2015) - [j137]Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour:
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29(1): 297-308 (2015) - [c41]Bruce A. Reed:
Connectivity Preserving Iterative Compression. CCCG 2015 - [i8]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR abs/1509.07680 (2015) - 2014
- [j136]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed:
Removable paths and cycles with parity constraints. J. Comb. Theory, Ser. B 106: 115-133 (2014) - [j135]Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory, Ser. B 109: 134-195 (2014) - [j134]Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - [i7]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. CoRR abs/1411.3047 (2014) - 2013
- [j133]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé:
Oriented trees in digraphs. Discret. Math. 313(8): 967-974 (2013) - [j132]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) - [j131]Andrew D. King, Bruce A. Reed:
Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory 73(3): 327-341 (2013) - [j130]Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed:
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27(2): 693-696 (2013) - [j129]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. 27(4): 1770-1774 (2013) - [c40]Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed:
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA 2013: 414-431 - 2012
- [j128]Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21(6): 803-815 (2012) - [j127]Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics:
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160(6): 834-865 (2012) - [j126]Bruce A. Reed, David R. Wood:
Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. 33(3): 374-379 (2012) - [j125]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2): 424-435 (2012) - [j124]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. 26(1): 145-168 (2012) - [i6]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012) - [i5]Andrew D. King, Bruce A. Reed:
A short proof that χ can be bounded ε away from Δ+1 towards ω. CoRR abs/1211.1410 (2012) - [i4]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. CoRR abs/1211.1999 (2012) - [i3]Andrew D. King, Bruce A. Reed:
Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$. CoRR abs/1212.3036 (2012) - 2011
- [j123]Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour:
The edge-density for K2, t minors. J. Comb. Theory, Ser. B 101(1): 18-46 (2011) - [c39]Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan:
The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36 - [c38]Bruce A. Reed:
Graph Coloring via The Probabilistic Method. SODA 2011: 184 - [i2]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. CoRR abs/1102.0805 (2011) - 2010
- [j122]Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed:
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7): 765-770 (2010) - [j121]Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. J. Comb. Theory, Ser. B 100(2): 226-246 (2010) - [j120]Michael Molloy, Bruce A. Reed:
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory, Ser. B 100(2): 247-249 (2010) - [c37]Ken-ichi Kawarabayashi, Bruce A. Reed:
A Separator Theorem in Minor-Closed Classes. FOCS 2010: 153-162 - [c36]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA 2010: 318-328 - [c35]Ken-ichi Kawarabayashi, Bruce A. Reed:
An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA 2010: 365-378 - [c34]Ken-ichi Kawarabayashi, Bruce A. Reed:
Odd cycle packing. STOC 2010: 695-704
2000 – 2009
- 2009
- [j119]Ken-ichi Kawarabayashi, Bruce A. Reed:
Highly parity linked graphs. Comb. 29(2): 215-225 (2009) - [j118]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. 157(12): 2577-2596 (2009) - [j117]W. Sean Kennedy, Conor Meagher, Bruce A. Reed:
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. Electron. Notes Discret. Math. 34: 47-51 (2009) - [j116]Nikolaos Fountoulakis, Bruce A. Reed:
A general critical condition for the emergence of a giant component in random graphs with given degrees. Electron. Notes Discret. Math. 34: 639-645 (2009) - [j115]Takehiro Ito, W. Sean Kennedy, Bruce A. Reed:
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. Electron. Notes Discret. Math. 35: 235-240 (2009) - [j114]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory, Ser. B 99(1): 20-29 (2009) - [j113]Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99(1): 30-38 (2009) - [j112]Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed:
Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms 35(3): 323-347 (2009) - [j111]Bruce A. Reed, David R. Wood:
A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms 5(4): 39:1-39:16 (2009) - [j110]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009) - [c33]Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. SODA 2009: 106-114 - [c32]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192 - [c31]Ken-ichi Kawarabayashi, Bruce A. Reed:
Hadwiger's conjecture is decidable. STOC 2009: 445-454 - 2008
- [j109]Colin McDiarmid, Bruce A. Reed:
On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. 17(4): 591-601 (2008) - [j108]Conor Meagher, Bruce A. Reed:
Fractionally total colouring Gn, p. Discret. Appl. Math. 156(7): 1112-1124 (2008) - [j107]Bruce A. Reed:
Skew partitions in perfect graphs. Discret. Appl. Math. 156(7): 1150-1156 (2008) - [j106]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Discret. Appl. Math. 156(7): 1168-1174 (2008) - [j105]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Discret. Appl. Math. 156(7): 1175-1180 (2008) - [j104]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. 156(12): 2270-2278 (2008) - [j103]Ken-ichi Kawarabayashi, Bruce A. Reed:
Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008) - [j102]Omid Amini, Bruce A. Reed:
List Colouring Constants of Triangle Free Graphs. Electron. Notes Discret. Math. 30: 135-140 (2008) - [j101]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
A weaker version of Lovász' path removal conjecture. J. Comb. Theory, Ser. B 98(5): 972-979 (2008) - [j100]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008) - [j99]Andrew D. King, Bruce A. Reed:
Bounding chi in terms of omega and delta for quasi-line graphs. J. Graph Theory 59(3): 215-228 (2008) - [j98]Nikolaos Fountoulakis, Bruce A. Reed:
The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Struct. Algorithms 33(1): 68-86 (2008) - [j97]Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. 22(1): 329-347 (2008) - [c30]Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed:
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780 - [c29]Bruce A. Reed, Zhentao Li:
Optimization and Recognition for K 5-minor Free Graphs in Linear Time. LATIN 2008: 206-215 - [c28]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454 - [c27]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs. SODA 2008: 621-630 - 2007
- [j96]Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. Comb. 27(1): 1-12 (2007) - [j95]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits. Comb. 27(2): 135-145 (2007) - [j94]Andrew D. King, Bruce A. Reed, Adrian Vetta:
An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007) - [j93]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. Electron. Notes Discret. Math. 29: 327-331 (2007) - [j92]Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed:
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29: 515-519 (2007) - [j91]David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23(Supplement-1): 41-65 (2007) - [j90]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007) - [c26]Arkadev Chattopadhyay, Bruce A. Reed:
Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM 2007: 395-408 - [c25]William S. Kennedy, Bruce A. Reed:
Fast Skew Partition Recognition. KyotoCGGT 2007: 101-107 - [c24]Dieter Rautenbach, Bruce A. Reed:
Domination in Cubic Graphs of Large Girth. KyotoCGGT 2007: 186-190 - [c23]Ken-ichi Kawarabayashi, Bruce A. Reed:
Computing crossing number in linear time. STOC 2007: 382-390 - 2006
- [j89]Colin McDiarmid, Bruce A. Reed:
Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006) - 2005
- [j88]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Electron. Notes Discret. Math. 19: 257-263 (2005) - [j87]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Electron. Notes Discret. Math. 19: 265-271 (2005) - [j86]Conor Meagher, Bruce A. Reed:
Fractionally total colouring Gn, p. Electron. Notes Discret. Math. 19: 297-303 (2005) - [j85]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39(1): 145-160 (2005) - [j84]Babak Farzad, Michael S. O. Molloy, Bruce A. Reed:
(Delta-k)-critical graphs. J. Comb. Theory, Ser. B 93(2): 173-185 (2005) - [j83]Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed:
Vertex colouring edge partitions. J. Comb. Theory, Ser. B 94(2): 237-244 (2005) - [j82]David Avis, Caterina De Simone, Bruce A. Reed:
On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. 33(4): 385-388 (2005) - [c22]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50 - [c21]Zhentao Li, Bruce A. Reed:
Heap Building Bounds. WADS 2005: 14-23 - [i1]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. CoRR abs/cs/0504082 (2005) - 2004
- [j81]Bruce A. Reed, Benny Sudakov:
List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Comb. 25(1): 117-123 (2004) - [j80]Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter:
Preface. Discret. Appl. Math. 141(1-3): 1 (2004) - [j79]Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed:
Stable skew partition problem. Discret. Appl. Math. 143(1-3): 17-22 (2004) - [j78]Bruce A. Reed, Paul D. Seymour:
Hadwiger's conjecture for line graphs. Eur. J. Comb. 25(6): 873-876 (2004) - [j77]Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory, Ser. B 91(1): 25-41 (2004) - [j76]Guillaume Fertin, André Raspaud, Bruce A. Reed:
Star coloring of graphs. J. Graph Theory 47(3): 163-182 (2004) - [j75]Bruce A. Reed, Kaleigh Smith, Adrian Vetta:
Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004) - [j74]Chính T. Hoàng, Bruce A. Reed:
On the Co-P3-Structure of Perfect Graphs. SIAM J. Discret. Math. 18(3): 571-576 (2004) - 2003
- [j73]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on random homomorphism from arbitrary graphs to Z. Discret. Math. 273(1-3): 173-181 (2003) - [j72]Colin McDiarmid, Bruce A. Reed:
Channel assignment on graphs of bounded treewidth. Discret. Math. 273(1-3): 183-192 (2003) - [j71]Bruce A. Reed:
The height of a random binary search tree. J. ACM 50(3): 306-332 (2003) - [j70]Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) - 2002
- [j69]Colin Cooper, Alan M. Frieze, Bruce A. Reed:
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. 11(3): 249-261 (2002) - [j68]Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11(4): 323-341 (2002) - [j67]Bruce A. Reed, Benny Sudakov:
Asymptotically the List Colouring Constants Are 1. J. Comb. Theory, Ser. B 86(1): 27-37 (2002) - [c20]Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed:
Polynomial time recognition of P4-structure. SODA 2002: 382-389 - 2001
- [j66]Dieter Rautenbach, Bruce A. Reed:
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Comb. 21(2): 267-278 (2001) - [j65]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10: 93-95 (2001) - [j64]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. 10: 176-180 (2001) - [j63]Colin McDiarmid, Bruce A. Reed:
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electron. Notes Discret. Math. 10: 198-201 (2001) - [j62]Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
Recognizing Planar Strict Quasi-Parity Graphs. Graphs Comb. 17(4): 745-757 (2001) - [c19]Dieter Rautenbach, Bruce A. Reed:
Approximately covering by cycles in planar graphs. SODA 2001: 402-406 - [c18]Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is nearly the maximum degree. STOC 2001: 462-470 - [c17]Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs. WG 2001: 140-153 - 2000
- [j61]Claude Berge, Bruce A. Reed:
Optimal packings of edge-disjoint odd cycles. Discret. Math. 211: 197-202 (2000) - [j60]