A Note on the Equitable Choosability of Complete Bipartite Graphs
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a proper coloring, f, of G such that f(v) ∈ L(v)...
| Main Authors: | , , , , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
University of Zielona Góra
2021-11-01
|
| סדרה: | Discussiones Mathematicae Graph Theory |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.7151/dmgt.2232 |