On coloring problems for the two-season multigraphs
Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 2, pp. 17-26
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
@article{DA_2015_22_2_a1,
author = {V. G. Vizing},
title = {On coloring problems for the two-season multigraphs},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {17--26},
year = {2015},
volume = {22},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2015_22_2_a1/}
}
V. G. Vizing. On coloring problems for the two-season multigraphs. Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 2, pp. 17-26. http://geodesic.mathdoc.fr/item/DA_2015_22_2_a1/
[1] V. G. Vizing, “On bases of vertices of a two-season directed graph”, Reports of Odessa Seminar on Discrete Mathematics, 15, Astroprint, Odessa, 2014, 13–16
[2] Garey M. R., Johnson D. S., Stockmeyer I. J., “Some simplified NP-complete graph problems”, Theoret. Comput. Sci., 1:3 (1976), 337–367 | DOI | MR
[3] König D., “Über Graphen und ihre Anvendung auf Determinantentheorie und Mengenlehre”, Math. Ann., 77 (1916), 453–465 | DOI | MR | Zbl