Author:
Fomin Fedor,Kratsch Dieter,Müller Haiko
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. K. Ando, A. Kaneko and S. Gervacio, The bandwidth of a tree with k leaves is at most [k/2], Discrete Mathematics, 150 (1996), pp. 403-406.
2. D. Bienstock, Graph searching, path-width, tree-width and related problems (asurvey), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 5 (1991), pp. 33–49.
3. J. A. Bondy, Basic graph theory: Paths and circuits, in Handbook of Combinatorics, Vol. 1, R. L. Graham, M. Grötschel, and L. Lovász,eds., Elsevier Science B.V., 1995, pp. 3–110.
4. A. Brandstädt, V. B. Le and J. P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia, 1999.
5. D. G. Corneil, S. Olariu and L. K. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM Journal on Computing, 28 (1999), pp. 1284–1297.