On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
Kostochka, Alexandr
The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2002-01-01
EUDML-ID : urn:eudml:doc:122367 
@article{01803676,
     title = {On a theorem of Erd\H os, Rubin, and Taylor on choosability of complete bipartite graphs.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {DS10},
     year = {2002},
     zbl = {1005.05018},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01803676}
}

Kostochka, Alexandr. On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.. The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002) . http://gdmltest.u-ga.fr/item/01803676/