Free Access
R.A.I.R.O. Informatique théorique
Volume 8, Number R1, 1974
Page(s) 49 - 53
Published online 01 February 2017
  1. [1]FOLKMAN J. and FULKERSON D. R., Edge colorings in bipartite graphs, in : Combinatorial Mathematics and its applications (University of North Carolina Press, Chapel Hill, 1969). [MR: 262112] [Zbl: 0204.57002] [Google Scholar]
  2. [2]De WERRA D., Equitable Colorations of Graphs, Revue française d'Informatique et de Recherche Opérationnelle, R-3, 1971, p. 3-8. [EuDML: 193186] [MR: 543812] [Zbl: 0239.05112] [Google Scholar]
  3. [3]HAJNAL A. and SZEMZRÉDI E., Proof of a conjecture of P. Erdösin : Combinatorial Theory and its applications, Balatonfüred, (Erdös, Rényri, V. T. Sos, éd.), North Holland, Amsterdam, 1970, p. 601-623. [Zbl: 0217.02601] [Google Scholar]
  4. [4]BERGE C., Graphes et hypergraphes, Paris, Dunod, 1970. [MR: 357173] [Zbl: 0213.25702] [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.