Free Access
Issue
RAIRO-Oper. Res.
Volume 12, Number 3, 1978
Page(s) 263 - 275
DOI https://doi.org/10.1051/ro/1978120302631
Published online 06 February 2017
  • 1. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. [MR: 357173] [Zbl: 0213.25702]
  • 2. P. ROSENSTIEHL: L'arbre minimal d'un graphe. Théorie des graphes (Journées internationales d'études, Rome, 1966) Dunod, Paris, 1967 , p. 357-368. [MR: 223270] [Zbl: 0202.55902]
  • 3. C. F. PICARD, Graphes et questionnaires, Gauthier-Villars, Paris, t. 1, chap. 7, 1972. [Zbl: 0266.94018]
  • 4. C. F. PICARD, Arbre minimal d'une somme de graphes, Cahiers du C.E.R.O., vol. 17 nos 2, 3, 4, 1975, p. 351-368. [MR: 404024] [Zbl: 0317.05102]
  • 5. I. TOMESCU, Un algorithme pour l'obtention d'une chaîne hamiltonienne en partant del'arbre minimal d'un graphe, R.A.I.R.O. vol. 3, octobre 1975, p. 5-12. [EuDML: 104625] [MR: 441774] [Zbl: 0322.05129]

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.