12
правок
Glk (обсуждение | вклад) (Новая страница: «'''<math>L</math>-Coloring with impropriety <math>d</math>''' --- <math>L</math>-раскраска с некорректностью <math>d</math>. A '''list ass…») |
AlexM (обсуждение | вклад) Нет описания правки |
||
Строка 3: | Строка 3: | ||
A '''list assignment''' of <math>G</math> is a function <math>L</math> which assigns a list of colors <math>L(v)</math> to each | A '''list assignment''' of <math>G</math> is a function <math>L</math> which assigns a list of colors <math>L(v)</math> to each | ||
vertex <math>v \in V(G)</math>. An '''<math>L</math>-coloring with impropriety <math>d</math>''', or simply '''<math>(L,d)*</math>-coloring | vertex <math>v \in V(G)</math>. An '''<math>L</math>-coloring with impropriety <math>d</math>''', or simply '''<math>(L,d)*</math>-coloring''', is a | ||
mapping <math>\lambda</math> which assigns to each vertex <math>v \in V(G)</math> a color | mapping <math>\lambda</math> which assigns to each vertex <math>v \in V(G)</math> a color | ||
<math>\lambda(v)</math> from <math>L(v)</math> so that <math>v</math> has at most <math>d</math> neighbours | <math>\lambda(v)</math> from <math>L(v)</math> so that <math>v</math> has at most <math>d</math> neighbours |
правок