Name
Abstract | ||
|---|---|---|
We construct graphs with lists of available colors for each vertex, such that the size of every list exceeds the maximum vertex-color degree, but there exists no proper coloring from the lists. This disproves a conjecture of Reed. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 106–109, 2002 |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/jgt.v41:2 | Journal of Graph Theory |
Keywords | Field | DocType |
list coloring | Graph theory,Edge coloring,Discrete mathematics,Topology,Complete coloring,Combinatorics,Fractional coloring,List coloring,Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
41 | 2 | 0364-9024 |
Citations | PageRank | References |
7 | 0.66 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Ron Holzman | 2 | 287 | 43.78 |