论文信息 - How to color a graph

How to color a graph

This paper attempts to give a short survey of graph coloring problems. The first two sections deal with edge colorings and node colorings of graphs. In section 4 some generalizations to hyper-graph coloring are described. Finally section 5 is devoted to the problem of balancing the colorings. For notations and definitions we follow C. Berge [4]. The multigraphs considered here have no loops.

D. de Werra

[1] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[2] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

[3] G. Szekeres,et al. An inequality for the chromatic number of a graph , 1968 .

[4] D. Matula. k-Components, Clusters and Slicings in Graphs , 1972 .

[5] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[6] Bruce P. Graham,et al. An Algorithm for Determining the Chromatic Number of a Graph , 1973, SIAM J. Comput..

[7] David W. Matula,et al. GRAPH COLORING ALGORITHMS , 1972 .

[8] J. R. Brown. Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[9] R. Z. Norman,et al. An algorithm for a minimum cover of a graph , 1959 .

[10] Dominique de Werra,et al. Investigations on an edge coloring problem , 1971, Discret. Math..

[11] D. de Werra. Equitable colorations of graphs , 1971 .

[12] Ronald C. Read,et al. Graph theory and computing , 1972 .

[13] Dominique de Werra. Decomposition of bipartite multigraphs into matchings , 1972, Z. Oper. Research.

[14] Michel Las Vergnas,et al. Une classe d'hypergraphes bichromatiques II , 1974, Discret. Math..