Name
Abstract | ||
|---|---|---|
For a hypergraph G and a positive integer s, let chi l(G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v is an element of V(G) and |L(u)boolean AND L(v)|<= s for all u,v is an element of e is an element of E(G). This parameter was studied by Kratochvil, Tuza, and Voigt for various kinds of graphs. Using randomized constructions we find the asymptotics of chi l(G,s) for balanced complete multipartite graphs and for complete k-partite k-uniform hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/jgt.21754 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
05C15,hypergraphs,separation,multipartite graphs,list coloring | Journal | 76.0 |
Issue | ISSN | Citations |
2.0 | 0364-9024 | 2 |
PageRank | References | Authors |
0.43 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán Füredi | 1 | 1237 | 233.60 |
| Alexandr V. Kostochka | 2 | 682 | 89.87 |
| Mohit Kumbhat | 3 | 23 | 3.62 |