Whitesides, Sue H. A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. (English) Zbl 0569.05043 Perfect graphs, Ann. Discrete Math. 21, 281-297 (1984). Reviewer: M.M.Sysło MSC: 05C70 05C75 68R10 68Q25 PDFBibTeX XML
Burlet, M.; Fonlupt, J. Polynomial algorithm to recognize a Meyniel graph. (English) Zbl 0558.05055 Perfect graphs, Ann. Discrete Math. 21, 225-252 (1984). Reviewer: M.M.Sysło MSC: 05C75 05C70 68R10 PDFBibTeX XML
Dyer, M. E.; Frieze, A. M.; McDiarmid, C. J. H. Partitioning heuristics for two geometric maximization problems. (English) Zbl 0551.90065 Oper. Res. Lett. 3, 267-270 (1984). MSC: 90C10 05C70 65K05 PDFBibTeX XMLCite \textit{M. E. Dyer} et al., Oper. Res. Lett. 3, 267--270 (1984; Zbl 0551.90065) Full Text: DOI
Pullman, Norman J. Clique covering of graphs IV. Algorithms. (English) Zbl 0548.05050 SIAM J. Comput. 13, 57-75 (1984). Reviewer: F.Göbel MSC: 05C70 05C99 68Q25 PDFBibTeX XMLCite \textit{N. J. Pullman}, SIAM J. Comput. 13, 57--75 (1984; Zbl 0548.05050) Full Text: DOI
Brandstädt, Andreas Partitions of graphs into one or two independent sets and cliques. (English) Zbl 0547.68068 Forschungsergeb., Friedrich-Schiller-Univ. Jena N/84/71, 13 p. (1984). MSC: 68R10 05C70 68Q25 PDFBibTeX XML
Hedman, Bruce Clique graphs of time graphs. (English) Zbl 0547.05056 J. Comb. Theory, Ser. B 37, 270-278 (1984). MSC: 05C99 05C70 05C35 PDFBibTeX XMLCite \textit{B. Hedman}, J. Comb. Theory, Ser. B 37, 270--278 (1984; Zbl 0547.05056) Full Text: DOI
Drezner, Zvi The p-centre problem - heuristic and optimal algorithms. (English) Zbl 0544.90024 J. Oper. Res. Soc. 35, 741-748 (1984). Reviewer: J.K.Lenstra MSC: 90B05 PDFBibTeX XMLCite \textit{Z. Drezner}, J. Oper. Res. Soc. 35, 741--748 (1984; Zbl 0544.90024) Full Text: DOI