Now showing items 1-1 of 1

  • Edge-choosability of Planar Graphs 

    Mashhadi Avaz Tehrani, Hediyeh (Brock University, 2013-09-26)
    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 ...