BACK TO MASCOTTE PUBLICATION INDEX
Publications of B. A. Reed

N. V. R. Mahadev and B. A. Reed.
A note on vertex orders for stability number.
J. Graph Theory,
30(2):113120,
1999.
[bibtexentry]

B. A. Reed.
Tree width and tangles: a new connectivity measure and some applications.
In Surveys in combinatorics, 1997 (London),
volume 241 of London Math. Soc. Lecture Note Ser.,
pages 87162.
Cambridge Univ. Press,
Cambridge,
1997.
[bibtexentry]

S. E. Markossian,
G. S. Gasparian,
and B. A. Reed.
$\beta$perfect graphs.
J. Combin. Theory Ser. B,
67(1):111,
1996.
[bibtexentry]

B. A. Reed and F. B. Shepherd.
The GallaiYounger conjecture for planar graphs.
Combinatorica,
16(4):555566,
1996.
[bibtexentry]

B. A. Reed,
N. Robertson,
A. Schrijver,
and P. D. Seymour.
Finding disjoint trees in planar graphs in linear time.
In Graph structure theory (Seattle, WA, 1991),
volume 147 of Contemp. Math.,
pages 295301.
Amer. Math. Soc.,
Providence, RI,
1993.
[bibtexentry]

C. T. Hoàng and B. A. Reed.
$P\sb 4$comparability graphs.
Discrete Math.,
74(12):173200,
1989.
Note: Graph colouring and variations.
[bibtexentry]

C. T. Hoàng and B. A. Reed.
Some classes of perfectly orderable graphs.
J. Graph Theory,
13(4):445463,
1989.
[bibtexentry]

C. J. H. McDiarmid and B. A. Reed.
Building heaps fast.
J. Algorithms,
10(3):352365,
1989.
[bibtexentry]

M. Bertschi and B. A. Reed.
Erratum: ``A note on even pairs'' [Discrete Math. 65 (1987), no. 3, 317318; MR0897656 (88f:05066)] by Reed.
Discrete Math.,
71(2):187,
1988.
[bibtexentry]

B. A. Reed.
A note on even pairs.
Discrete Math.,
65(3):317318,
1987.
[bibtexentry]

M. Molloy and B. A. Reed.
Asymptotically optimal frugal colouring.
In Proceedings of Twentieth Annual ACMSIAM Symposium on Discrete Algorithms (SODA),
pages 106114,
2009.
[WWW
] [PDF
] [Abstract] [bibtexentry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:02 2013
This document was translated from BibT_{E}X by
bibtex2html