Show simple item record

dc.contributor.authorFerreri, Susanna
dc.date.accessioned2013-09-05T13:51:29Z
dc.date.available2013-09-05T13:51:29Z
dc.date.issued2013-09-05
dc.identifier.urihttp://hdl.handle.net/10464/4957
dc.description.abstractThe conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectGraph Theoryen_US
dc.subjectplanar graphsen_US
dc.subjectchoosabilityen_US
dc.subjectacyclicen_US
dc.titleAcyclic 5-Choosability of Planar Graphs Without Adjacent Short Cyclesen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Mathematics and Statisticsen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Mathematicsen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
dc.embargo.termsNoneen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record