Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles

The 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.

Name thesis:degree_name

M.Sc. Mathematics and Statistics

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Faculty of Mathematics and Science

Department dc:contributor.department

Department of Mathematics

Grantor

Brock University

Year dc:date.issued

2013

Author dc:creator

• Ferreri, Susanna

• Graph Theory
• planar graphs
• choosability
• acyclic

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/10464/4957

OAI identifier oai:identifier

oai:brocku.scholaris.ca:10464/4957