Sciweavers

CORR
2008
Springer
58views Education» more  CORR 2008»
14 years 17 days ago
Some results on (a:b)-choosability
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
Shai Gutner, Michael Tarsi