Publications of B. A. Reed
BACK TO COATI PUBLICATION INDEXPublications of B. A. Reed
| Articles in journal or book's chapters |
-
N. V. R. Mahadev and B. A. Reed.
A note on vertex orders for stability number.
J. Graph Theory,
30(2):113--120,
1999.
[bibtex-entry]
-
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 87--162.
Cambridge Univ. Press,
Cambridge,
1997.
[bibtex-entry]
-
S. E. Markossian,
G. S. Gasparian,
and B. A. Reed.
$\beta$-perfect graphs.
J. Combin. Theory Ser. B,
67(1):1--11,
1996.
[bibtex-entry]
-
B. A. Reed and F. B. Shepherd.
The Gallai-Younger conjecture for planar graphs.
Combinatorica,
16(4):555--566,
1996.
[bibtex-entry]
-
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 295--301.
Amer. Math. Soc.,
Providence, RI,
1993.
[bibtex-entry]
-
C. T. Hoàng and B. A. Reed.
Some classes of perfectly orderable graphs.
J. Graph Theory,
13(4):445--463,
1989.
[bibtex-entry]
-
C. T. Hoàng and B. A. Reed.
$P\sb 4$-comparability graphs.
Discrete Math.,
74(1-2):173--200,
1989.
Note: Graph colouring and variations. [bibtex-entry]
-
C. J. H. McDiarmid and B. A. Reed.
Building heaps fast.
J. Algorithms,
10(3):352--365,
1989.
[bibtex-entry]
-
M. Bertschi and B. A. Reed.
Erratum: ``A note on even pairs'' [Discrete Math. \bf 65 (1987), no. 3, 317--318; MR0897656 (88f:05066)] by Reed.
Discrete Math.,
71(2):187,
1988.
[bibtex-entry]
-
B. A. Reed.
A note on even pairs.
Discrete Math.,
65(3):317--318,
1987.
[bibtex-entry]
| Conference's articles |
-
M. Molloy and B. A. Reed.
Asymptotically optimal frugal colouring.
In Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),
pages 106-114,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:46 2022