×
de Werra, Dominique

A note on graph coloring. (English) Zbl 0279.05105

Rev. Franc. Automat. Inform. Rech. Operat. 8, Informatique Theor., No.R-1, 49-53 (1974).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0279.05105

MSC:

05C15 Coloring of graphs and hypergraphs
05C99 Graph theory
PDF BibTeX XML Cite
\textit{D. de Werra}, Rev. Franc. Automat. Inform. Rech. Operat., R 8, No. 1, 49--53 (1974; Zbl 0279.05105)
Full Text: EuDML
  • logo of hbz
  • logo of WorldCat

References:

[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). Zbl0204.57002 MR262112 · 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. Zbl0239.05112 MR543812 · 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. Zbl0217.02601 · Zbl 0217.02601
[4] BERGE C., Graphes et hypergraphes, Paris, Dunod, 1970. Zbl0213.25702 MR357173 · Zbl 0213.25702
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.