Shai Gutner

most citedSome results on (a:b)-choosability

7 citations · 10 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2008

The complexity of planar graph choosability

Shai Gutner

A graph $G$ is {\em $k$ -choosable} if for every assignment of a set $S (v)$ of $k$ colors to every vertex $v$ of $G$ , there is a proper coloring of $G$ that assigns to each vertex $…

cs.DM2008★ 3 cited

Choice numbers of graphs

Shai Gutner

A solution to a problem of Erdős, 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.…

cs.DM2008★ 7 cited

Some results on (a:b)-choosability

Shai Gutner, Michael Tarsi

A solution to a problem of Erdős, 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.…