11949 search results - page 12 / 2390 » Some results on (a:b)-choosability |
101
Voted
EUSFLAT
2003
15 years 2 months ago
2003
60
Voted
FLAIRS
1998
15 years 2 months ago
1998
61
Voted
IJCAI
1993
15 years 2 months ago
1993
CORR
2008
Springer
15 years 25 days ago
2008
Springer
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...
90
Voted
EJC
2008
15 years 25 days ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...