Name
Abstract | ||
|---|---|---|
A well-established generalization of graph coloring is the concept of list coloring. In this setting, each vertex v of a graph G is assigned a list L(v) of k colors and the goal is to find a proper coloring c of G with c(v)∈L(v). The smallest integer k for which such a coloring c exists for every choice of lists is called the list chromatic number of G and denoted by χl(G). |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.disc.2006.03.062 | Discrete Mathematics |
Keywords | Field | DocType |
Graph coloring,List coloring,Cartesian product of graphs,Products of graph | Edge coloring,Complete coloring,Discrete mathematics,Combinatorics,Fractional coloring,Cartesian product of graphs,List coloring,Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
306 | 16 | 0012-365X |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mieczysław Borowiecki | 1 | 62 | 7.76 |
| Stanislav Jendrol’ | 2 | 67 | 7.66 |
| Daniel Král' | 3 | 129 | 18.89 |
| Jozef Miškuf | 4 | 51 | 5.20 |