Uniquely list colorability of the graph Kn^2 + Om
Given a list L(v) for each vertex v, we say that the graph G is L-colorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely k-list colorable if there is a list assignment L such that jL(v)j = k for every vertex v and the graph has exactl...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad Nacional de Trujillo
2020-07-01
|
| Series: | Selecciones Matemáticas |
| Subjects: | |
| Online Access: | https://revistas.unitru.edu.pe/index.php/SSMM/article/view/2953/3283 |