Choosability and edge choosability of planar graphs without five cycles (Q1609512)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1781919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Choosability and edge choosability of planar graphs without five cycles |
scientific article; zbMATH DE number 1781919 |
Statements
Choosability and edge choosability of planar graphs without five cycles (English)
0 references
15 August 2002
0 references
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.
0 references
edge choosability
0 references
degeneracy
0 references
planar graph
0 references
0.9284080862998962
0 references
0.9146313071250916
0 references
0.9019834399223328
0 references
0.8928516507148743
0 references
0.8840329051017761
0 references
