Edge-choosability of Planar Graphs
type: CreativeWork
description: 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.
abstract: 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.
author: Mashhadi Avaz Tehrani, Hediyeh
language: eng
keywords: Edge-choosability, List-edge-colouring, Planar graphs
date published: 2013-09-26
date modified: 2026-07-24T01:23:12Z
provider: Brock University
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: Brock University

PropertyValue
property ID: Handle
value: http://hdl.handle.net/10464/5004