A note on graph coloring
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 8 (1974) no. R1, p. 49-53
@article{ITA_1974__8_1_49_0,
     author = {de Werra, D.},
     title = {A note on graph coloring},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     publisher = {EDP-Sciences},
     volume = {8},
     number = {R1},
     year = {1974},
     pages = {49-53},
     zbl = {0279.05105},
     mrnumber = {340085},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1974__8_1_49_0}
}
De Werra, D. A note on graph coloring. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 8 (1974) no. R1, pp. 49-53. http://www.numdam.org/item/ITA_1974__8_1_49_0/

[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

[2]De Werra D., Equitable Colorations of Graphs, Revue française d'Informatique et de Recherche Opérationnelle, R-3, 1971, p. 3-8. | Numdam | MR 543812 | Zbl 0239.05112

[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

[4]Berge C., Graphes et hypergraphes, Paris, Dunod, 1970. | MR 357173 | Zbl 0213.25702