Mineurs d'arbres avec racines
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 401-422. 
@article{ITA_1995__29_5_401_0,
     author = {Courcelle, B. and Pari\`es, A.},
     title = {Mineurs d'arbres avec racines},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {401--422},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {5},
     year = {1995},
     mrnumber = {1360667},
     zbl = {0838.68083},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1995__29_5_401_0/}
}
TY  - JOUR
AU  - Courcelle, B.
AU  - Pariès, A.
TI  - Mineurs d'arbres avec racines
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1995
SP  - 401
EP  - 422
VL  - 29
IS  - 5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1995__29_5_401_0/
LA  - fr
ID  - ITA_1995__29_5_401_0
ER  - 
%0 Journal Article
%A Courcelle, B.
%A Pariès, A.
%T Mineurs d'arbres avec racines
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 401-422
%V 29
%N 5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1995__29_5_401_0/
%G fr
%F ITA_1995__29_5_401_0
Courcelle, B.; Pariès, A. Mineurs d'arbres avec racines. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 401-422. http://archive.numdam.org/item/ITA_1995__29_5_401_0/

1. A. Aho, J. Hopcroft et J. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974. | MR | Zbl

2. I. Anderson, Combinatorics offinite sets, Clarendon Press, Oxford, 1987. | MR | Zbl

3. S. Arnborg, A. Proskurowski et D. Corneil, Forbidden minors characterization of partial 3-trees, Discrete Mathematics, 1990, 80, p. 1-19. | MR | Zbl

4. N. De Bruin, C. A. Van Ebbenhorst et D. Kruyswijk, On the set of divisors of a number, Nieuw Arch. Wisk, 1952, 23, p. 191-193. | MR | Zbl

5. M. Fellows et M. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterization, Proceedings of "Foundations of Computer Science", 1989, p. 520-525.

6. M. Fellows, The Roberston-Seymour theorems: A survey of applications, A.M.S., Contemporary Mathematics, 1989, 89, p. 1-17. | MR | Zbl

7. G. A. Ikorong, Arbres et largeur linéaires des graphes, Thèse, Université Joseph Fourier-Grenoble-I, 1992.

8. J. Matousek et R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Mathematics, 1992, 108, p. 343-364. | MR | Zbl

9. A. Proskurowski, Graph reductions and techniques for finding minimal forbidden minors, dans Graph structure theory, N. ROBERTSON et P. SEYMOUR Eds., A.M.S., Contemporary Mathematics, 1993, 147, p. 591-600. | MR | Zbl

10. N. Roberston et P. Seymour, Graph minors I: Excluding a forest, Journal of Combinatorial Theory, Series B, 1983, 35, p. 39-61. | MR | Zbl

11. N. Robertson et P. Seymour, Graph minors II: Algorithmic aspects of tree-width, Journal of algorithms, 1986, 7, p. 309-322. | MR | Zbl

12. N. Robertson et P. Seymour, Graph minors XIII: The disjoint paths problem, septembre 1986.

13. N. Robertson et P. Seymour, Graph minors XX: Wagner's conjecture, septembre 1988.