|
Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 4, Pages 35–47
(Mi da695)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Multicoloring of incidentors of weighted undirected multigraph
V. G. Vizing Odessa, Ukraine
Abstract:
Undirected multigraphs with weighted edges are considered. In multicoloring of incidentors, every incidentor should be assigned with a multicolor, i.e. an interval of colors whose length is equal to the weight of the incidentor. A multicoloring is proper if the multicolors of any two adjacent or junction incidentors do not intersect. Upper and lower bounds for the minimum number of colors necessary for a proper multicoloring of all incidentors of a multigraph are presented. Ill. 1, bibliogr. 10.
Keywords:
incidentor, multicoloring, incidentor multichromatic number.
Received: 18.11.2011 Revised: 26.01.2012
Citation:
V. G. Vizing, “Multicoloring of incidentors of weighted undirected multigraph”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 35–47; J. Appl. Industr. Math., 6:4 (2012), 514–521
Linking options:
https://www.mathnet.ru/eng/da695 https://www.mathnet.ru/eng/da/v19/i4/p35
|
Statistics & downloads: |
Abstract page: | 296 | Full-text PDF : | 74 | References: | 44 | First page: | 5 |
|