Author:
Fomin Fedor V,Golovach Petr A
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference27 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. On interval graphs and matrice profiles;Billionnet;RAIRO Rech. Opér.,1986
3. A. Blum, G. Konjevod, R. Ravi, S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Theoret. Comput. Sci. 235 (2000) 25–42, Selected papers in honor of Manuel Blum (Hong Kong, 1998).
4. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
5. J.A. Bondy, Basic graph theory: paths and circuits, in: R.L. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Vol. 1, Elsevier Science B.V., Amsterdam, 1995, pp. 3–110.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献