|
This article is cited in 1 scientific paper (total in 1 paper)
On coloring problems for the two-season multigraphs
V. G. Vizing Apt. 26, 18/2 Varnenskaya St., 165070 Odessa, Ukraine
Abstract:
It is supposed that there are two moments of time called seasons in which a multigraph can have various sets of edges. Such multigraphs are called two-season. In coloring vertices or edges every object
is colored in one season. Some bounds on two-season chromatic number are given and the exact algorithm for the minimal edge coloring of a bipartite two-season multigraph is presented. Bibliogr. 3.
Keywords:
two-season multigraph, two-season coloring.
Received: 22.12.2014 Revised: 16.02.2015
Citation:
V. G. Vizing, “On coloring problems for the two-season multigraphs”, Diskretn. Anal. Issled. Oper., 22:2 (2015), 17–26; J. Appl. Industr. Math., 9:2 (2015), 292–296
Linking options:
https://www.mathnet.ru/eng/da810 https://www.mathnet.ru/eng/da/v22/i2/p17
|
Statistics & downloads: |
Abstract page: | 255 | Full-text PDF : | 89 | References: | 43 | First page: | 11 |
|