Free Access
Volume 6, Number R1, 1972
Page(s) 88 - 91
Published online 01 February 2017
  1. 1. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. [MR: 357173] [Zbl: 0213.25702] [Google Scholar]
  2. 2. A. ERSHOV et G. KUZHUKHIN, « Estimates of the chromatic number of connected graphs », Dokl. Akad. Nauk, 142, 2, 1962, p.270-273. [MR: 140445] [Zbl: 0113.38802] [Google Scholar]
  3. 3. I. TOMESCU, Le nombre des graphes connexes k-chromatiques minimaux aux sommets étiquetés, C.R. Acad. Sc. Paris, A, 273, 1971, p. 1124-1126. [MR: 291027] [Zbl: 0223.05115] [Google Scholar]

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.

Recommended for you