Edge-choosability of Planar Graphs

According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesis, we discuss a relaxed version of this conjecture that every simple graph G is edge-(∆ + 1)-choosable as by Vizing’s Theorem ∆(G) ≤χ' (G)≤∆(G) + 1. We prove that if G is a planar graph without 7-cycles with ∆(G)≠5,6 , or without adjacent 4-cycles with ∆(G)≠5, or with no 3-cycles adjacent to 5-cycles, then G is edge-(∆ + 1)-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

• Mashhadi Avaz Tehrani, Hediyeh

• Edge-choosability, List-edge-colouring, Planar graphs

Language dc:language.iso

eng

Handle dc:identifier.uri

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

OAI identifier oai:identifier

oai:brocku.scholaris.ca:10464/5004