1294
правки
Glk (обсуждение | вклад) (Новая страница: «'''Chromatic index''' --- хроматический индекс, хроматический класс. This is the least integer <math>k</math> for which the edg…») |
KVN (обсуждение | вклад) Нет описания правки |
||
Строка 1: | Строка 1: | ||
'''Chromatic index''' | '''Chromatic index''' — [[хроматический индекс]], [[хроматический класс]]. | ||
This is the least integer <math>k</math> for which the edges of <math>G</math> can be colored so | This is the least integer <math>k</math> for which the [[edge|edges]] of <math>G</math> can be colored so that [[adjacent edges|''adjacent'' edges]] have different colores. We denote it by | ||
that ''adjacent'' edges have different colores. We denote it by | <math>q(G)</math>. Clearly, <math>q(G) = \chi(L(G))</math>. Here <math>L(G)</math> is the ''[[line graph]]'' of <math>G</math>. | ||
<math>q(G)</math>. Clearly, <math>q(G) = \chi(L(G))</math>. Here <math>L(G)</math> is the ''line graph'' of <math>G</math>. | |||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. |