Free Access
Issue
RAIRO-Oper. Res.
Volume 19, Number 2, 1985
Page(s) 185 - 201
DOI https://doi.org/10.1051/ro/1985190201851
Published online 06 February 2017
  • 1. B. BOLLOBAS, I. RIVAL, The maximal size of the covering graph of a lattice, Algebra Universalis, vol. 9, 1979, p. 371-373. [MR: 544860] [Zbl: 0424.05045]
  • 2. M. CHEIN, Communication personnelle.
  • 3. L. COMTET, Analyse combinatoire, T.1., PUF, Paris, 1970. [Zbl: 0221.05001]
  • 4. R. JEGOU, Quelques propriétés algorithmiques des ensembles ordonnés, Thèse 3e cycle, U.S.T.L., Montpellier, octobre 1984.
  • 5. V. KOUBEK, V. RODL, On the number of covering arcs in ordering, Commentationes Mathematicae Universitatis Carolinae, vol. 22, n° 4, 1981, p. 721-733. [EuDML: 17145] [MR: 647020] [Zbl: 0483.05035]
  • 6. J. E. MACDONALD Jr., Problem E 1643, Amer. Math. Monthly, 70 (1963), p. 1099. Solutions in Amer. Math. Monthly, vol. 71, 1964, p. 914-915. [MR: 1532438]
  • 7. B. ROY, Algèbre moderne et Théorie des graphes, T. 1, Dunod, Paris, 1969. [Zbl: 0238.90072] [MR: 250927]
  • 8. P. TURAN, On the theory of graphs, Colloq. Math., vol. 3, 1954, p. 19-30. [EuDML: 210003] [MR: 62416] [Zbl: 0055.17004]

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.