1105 search results - page 2 / 221 » Linear choosability of graphs |
JGT
2008
13 years 5 months ago
2008
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
COMBINATORICS
2006
13 years 5 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
COMBINATORICS
2002
13 years 5 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
COMBINATORICS
2006
13 years 5 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...