Tucker, Alan Coloring perfect \((K_ 4\)-e)-free graphs. (English) Zbl 0585.05007 J. Comb. Theory, Ser. B 42, 313-318 (1987). MSC: 05C15 05C99 PDFBibTeX XMLCite \textit{A. Tucker}, J. Comb. Theory, Ser. B 42, 313--318 (1987; Zbl 0585.05007) Full Text: DOI
Giles, Rick; Trotter, L. E. jun.; Tucker, Alan The strong perfect graph theorem for a class of partitionable graphs. (English) Zbl 0555.05043 Perfect graphs, Ann. Discrete Math. 21, 161-167 (1984). Reviewer: R.Hemminger MSC: 05C35 05C15 PDFBibTeX XML
Tucker, Alan; Wilson, Donna An \(O(N^ 2)\) algorithm for coloring perfect planar graphs. (English) Zbl 0538.05036 J. Algorithms 5, 60-68 (1984). Reviewer: P.van Emde Boas MSC: 05C15 68Q25 68R10 PDFBibTeX XMLCite \textit{A. Tucker} and \textit{D. Wilson}, J. Algorithms 5, 60--68 (1984; Zbl 0538.05036) Full Text: DOI
Tucker, Alan Uniquely colorable perfect graphs. (English) Zbl 0508.05037 Discrete Math. 44, 187-194 (1983). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Tucker}, Discrete Math. 44, 187--194 (1983; Zbl 0508.05037) Full Text: DOI
Tucker, Alan Coloring graphs with stable cutsets. (English) Zbl 0498.05028 J. Comb. Theory, Ser. B 34, 258-267 (1983). MSC: 05C15 05C70 05C40 PDFBibTeX XMLCite \textit{A. Tucker}, J. Comb. Theory, Ser. B 34, 258--267 (1983; Zbl 0498.05028) Full Text: DOI
Tucker, Alan C. Berge’s strong perfect graph conjecture. (English) Zbl 0486.05054 Combinatorial mathematics, 2nd int. Conf., New York 1978, Ann. New York Acad. Sci. 319, 530-535 (1979). MSC: 05C70 05C15 PDFBibTeX XML