Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Marsh Max"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 1215-1233 (2021)
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
Externí odkaz:
https://doaj.org/article/c7ae53c059b04d8cb4d57a43c6815b43
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 \in V(G)$, and an equitable $L$-c
Externí odkaz:
http://arxiv.org/abs/1908.01657
Autor:
Taylor, Irvin E., Marsh, Max M.
Publikováno v:
Annals of the New York Academy of Sciences; Jul1960, Vol. 87 Issue 2, p775-781, 7p
Publikováno v:
In Journal of Pharmaceutical Sciences (Scientific Edition) October 1954 43(10):605-608
Publikováno v:
In Tetrahedron Letters 1966 7(10):1023-1027