Search results
Results From The WOW.Com Content Network
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
For a graph G, let χ(G) denote the chromatic number and Δ(G) the maximum degree of G.The list coloring number ch(G) satisfies the following properties.. ch(G) ≥ χ(G).A k-list-colorable graph must in particular have a list coloring when every vertex is assigned the same list of k colors, which corresponds to a usual k-coloring.
This color-related article is a stub. You can help Wikipedia by expanding it.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us