1. N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica 17 (1997), 209–223. 381
2. H. Alt, N. Blum, K. Mehlhorn, and M. Paul, Computing a maximum matching in a bipartite graph in time O(n 1.5√m/log n), Inform. Proc. Lett. 37 (1991), 237–240.
3. A. Brandstädt, Special graph classes — a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Gesamthochschule Duisburg, 1993. 379, 381
4. A. Brandstädt, F. Dragan, and E. Köhler, Efficient algorithms for Hamiltonian problems on (claw, net)-free graphs, Proc. of WG’99, To appear. 378, 378
5. H. Broersma, T. Kloks, D. Kratsch, and H. Müller, Independent sets in asteroidal triple-free graphs, Proceedings of ICALP’97, Springer-Verlag, LNCS 1256, 1997, Berlin, 760–770. 378, 387