Edge choosability of planar graphs without short cycles (Q880873)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge choosability of planar graphs without short cycles |
scientific article; zbMATH DE number 5157299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge choosability of planar graphs without short cycles |
scientific article; zbMATH DE number 5157299 |
Statements
Edge choosability of planar graphs without short cycles (English)
0 references
29 May 2007
0 references
The author proves that if \(G\) is a planar graph with maximum vertex degree \(\Delta= 5\) and without \(4\)- or \(6\)-cycles, then \(G\) is edge-\(6\)-choosable. It follows that for each \(k\in \{3,4,5,6\}\), a \(k\)-cycle-free planar graph \(G\) is edge-\((\Delta+ 1)\)-choosable.
0 references
planar graph
0 references
chromatic index
0 references
edge-\(k\)-choosability
0 references
