Show simple item record

dc.contributor.advisorJohnson, Peter
dc.contributor.authorAllagan, Julian Apelete
dc.date.accessioned2009-07-15T13:31:54Z
dc.date.available2009-07-15T13:31:54Z
dc.date.issued2009-07-15T13:31:54Z
dc.identifier.urihttp://hdl.handle.net/10415/1780
dc.description.abstractThe choice numbers of some complete k−partite graphs are found, after we resolved a dispute regarding the choice number of K(4, 2, . . . , 2) when k is odd. Estimates of the choice numbers and the Ohba numbers of K(m, n, 1, . . . , 1) and K(m, n, 2, . . . , 2) are also discussed for various values of n and m. Finally we close this research with the Hall numbers of K(m, 2, . . . , 2) when m = 2,4.en
dc.rightsEMBARGO_NOT_AUBURNen
dc.subjectMathematics and Statisticsen
dc.titleChoice numbers, Ohba numbers and Hall numbers of some complete k-partite graphsen
dc.typedissertationen
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US


Files in this item

Show simple item record