Fitzpatrick, Shannon L.MacGillivray, Gary2010-05-112010-05-1120032010-05-11http://hdl.handle.net/1828/2746It is known that the smallest complete bipartite graph which is not 3-choosable has 14 vertices. We show that the extremal configuration is unique.entechnical reports (mathematics and statistics)Non 3-choosable bipartite graphs and the Fano planeTechnical ReportDepartment of Mathematics and Statistics