Choosability and edge choosability of planar graphs without five cycles
type: Item
instance of: scholarly article
title: Choosability and edge choosability of planar graphs without five cycles
zbMATH Open document ID: 0994.05060
DOI: 10.1016/S0893-9659(02)80007-6
author: Ko-Wei Lih
author: Weifan Wang
published in: Applied Mathematics Letters
publication date: 2002-08-15T00:00:00Z
review text: It is proved that every planar graph \(G\) of minimum degree \(\geq 3\) without cycles of length 5 contains an edge \(xy\) with degree-3 vertex \(x\) and degree-\((\leq 5)\) vertex \(y\). Based on this result the authors prove that \(G\) is four choosable and also edge-\((\delta(G)+1)\)-choosable.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1781919
zbMATH Keywords: edge choosability
zbMATH Keywords: degeneracy
zbMATH Keywords: planar graph
reviewed by: Stanislav Jendroľ
MaRDI profile type: Publication
cites work: List edge chromatic number of graphs with large girth
cites work: Graphs of degree 4 are 5-edge-choosable
description: scientific article; zbMATH DE number 1781919