Equitable colorations of graphs
Revue française d'informatique et de recherche opérationnelle. Série rouge, Tome 5 (1971) no. R3, pp. 3-8.
@article{M2AN_1971__5_3_3_0,
     author = {de Werra, D.},
     title = {Equitable colorations of graphs},
     journal = {Revue fran\c{c}aise d'informatique et de recherche op\'erationnelle. S\'erie rouge},
     pages = {3--8},
     publisher = {Dunod},
     address = {Paris},
     volume = {5},
     number = {R3},
     year = {1971},
     mrnumber = {543812},
     zbl = {0239.05112},
     language = {en},
     url = {http://archive.numdam.org/item/M2AN_1971__5_3_3_0/}
}
TY  - JOUR
AU  - de Werra, D.
TI  - Equitable colorations of graphs
JO  - Revue française d'informatique et de recherche opérationnelle. Série rouge
PY  - 1971
SP  - 3
EP  - 8
VL  - 5
IS  - R3
PB  - Dunod
PP  - Paris
UR  - http://archive.numdam.org/item/M2AN_1971__5_3_3_0/
LA  - en
ID  - M2AN_1971__5_3_3_0
ER  - 
%0 Journal Article
%A de Werra, D.
%T Equitable colorations of graphs
%J Revue française d'informatique et de recherche opérationnelle. Série rouge
%D 1971
%P 3-8
%V 5
%N R3
%I Dunod
%C Paris
%U http://archive.numdam.org/item/M2AN_1971__5_3_3_0/
%G en
%F M2AN_1971__5_3_3_0
de Werra, D. Equitable colorations of graphs. Revue française d'informatique et de recherche opérationnelle. Série rouge, Tome 5 (1971) no. R3, pp. 3-8. http://archive.numdam.org/item/M2AN_1971__5_3_3_0/

[1] P. Camion, Characterization of totally unimodular matrice, Proc. Am. Math. Soc., vol. 16, n° 5, october 1965. | MR | Zbl

[2] A. Ghouila - Houri, Caractérisation des matrices totalement uni-modulaires, C. R. Acad. Sci. Paris, vol. 254, 1192. | MR | Zbl

[3] C. Berge, Théorie des graphes et des hypergraphes, Dunod, Paris, 1970. | Zbl

[4] C. Berge, Sur certains hypergraphes généralisant les graphes bipartites, pp. 119-133 in Combinatorial Theory and its Applications, Balatonfured (P. Erdös, A. Renyi, V. T. Sos, ed.) North-Holland Publishing Co., Amsterdam, London, 1970. | MR | Zbl

[5] C. Berge, Six papers on graph theory. Indian Statistical Institute, Calcutta, 1963.

[6] J. Folkman and D. R. Fulkerson, Edge Colorings in Bipartite Graphs, Chapter 31 in Combinatorial Mathematics and their Applications (R. C. Bose and T. A. Dowling, ed.), University of North Carolina Press, Chapel Hill, 1969). | MR | Zbl

[7] D. Werra, Some Combinatorial Problems Arising in Scheduling, Canad. Op. Res. Soc. Journal, vol. 8, n° 3, november 1970. | MR | Zbl