Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 5, 1995
Page(s) 401 - 422
DOI https://doi.org/10.1051/ita/1995290504011
Published online 01 February 2017
  1. 1. A. AHO, J. HOPCROFT et J. ULLMAN, The design and analysis of computer algorithms, Addison-Wesley, 1974. [MR: 413592] [Zbl: 0326.68005]
  2. 2. I. ANDERSON, Combinatorics offinite sets, Clarendon Press, Oxford, 1987. [MR: 892525] [Zbl: 0604.05001]
  3. 3. S. ARNBORG, A. PROSKUROWSKI et D. CORNEIL, Forbidden minors characterization of partial 3-trees, Discrete Mathematics, 1990, 80, p. 1-19. [MR: 1045920] [Zbl: 0701.05016]
  4. 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: 43115] [Zbl: 0043.04301]
  5. 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. 6. M. FELLOWS, The Roberston-Seymour theorems: A survey of applications, A.M.S., Contemporary Mathematics, 1989, 89, p. 1-17. [MR: 1006472] [Zbl: 0692.68030]
  7. 7. G. A. IKORONG, Arbres et largeur linéaires des graphes, Thèse, Université Joseph Fourier-Grenoble-I, 1992.
  8. 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: 1189856] [Zbl: 0764.68128]
  9. 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: 1224733] [Zbl: 0787.05032]
  10. 10. N. ROBERSTON et P. SEYMOUR, Graph minors I: Excluding a forest, Journal of Combinatorial Theory, Series B, 1983, 35, p. 39-61. [MR: 723569] [Zbl: 0521.05062]
  11. 11. N. ROBERTSON et P. SEYMOUR, Graph minors II: Algorithmic aspects of tree-width, Journal of algorithms, 1986, 7, p. 309-322. [MR: 855559] [Zbl: 0611.05017]
  12. 12. N. ROBERTSON et P. SEYMOUR, Graph minors XIII: The disjoint paths problem, septembre 1986. [Zbl: 0823.05038]
  13. 13. N. ROBERTSON et P. SEYMOUR, Graph minors XX: Wagner's conjecture, septembre 1988. [Zbl: 1061.05088]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.