On coloring problems for two-season multigraphs
V. G. Vizing · Journal of Applied and Industrial Mathematics · 2015
Suppose that there are two moments of time called seasons at which a multigraph can have different sets of edges. These multigraphs with changing structure are called two-season multigraphs . In the process of coloring vertices or edges, each object is colored in one season. Some bounds on the two-season chromatic number are given, and an exact algorithm is described for minimal coloring of edges of a bipartite two-season multigraph.