On a theorem of ErdH os, Rubin, and Taylor on choosability of complete bipartite graphs

Research output: Contribution to journalArticlepeer-review

Original languageEnglish (US)
Pages (from-to)Note 9, 4
JournalElectronic Journal of Combinatorics
Volume9
Issue number1
StatePublished - 2002

Cite this