|
Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 6, Pages 77–95
(Mi da632)
|
|
|
|
On perfect colorings of line graphs
D. B. Khoroshilova Novosibirsk State University, Novosibirsk, Russia
Abstract:
The description of all feasible perfect colorings of line graphs, using two colors, is given, and all matrices of parameters of such colorings are listed. In addition, a simple construction that makes it possible to produce perfect colorings of arbitrary line graphs is proposed, and the perfect colorings which can be obtained with the use of the construction in question are characterized. Bibl. 13.
Keywords:
perfect coloring, equitable partition, line graph.
Received: 10.10.2009 Revised: 25.07.2010
Citation:
D. B. Khoroshilova, “On perfect colorings of line graphs”, Diskretn. Anal. Issled. Oper., 17:6 (2010), 77–95
Linking options:
https://www.mathnet.ru/eng/da632 https://www.mathnet.ru/eng/da/v17/i6/p77
|
Statistics & downloads: |
Abstract page: | 240 | Full-text PDF : | 113 | References: | 34 | First page: | 1 |
|