Edge choosability of planar graphs without short cycles
From MaRDI portal
Publication:880873
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.
Recommendations
- Edge choosability of planar graphs without 5-cycles with a chord
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- Edge-choosability of planar graphs without chordal 6-cycles
Cited in
(14)- Edge choosability of planar graphs without 5-cycles with a chord
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- A note on edge-group choosability of planar graphs without 5-cycles
- Structural properties and edge choosability of planar graphs without 6-cycles
- A Note on Edge Choosability and Degeneracy of Planar Graphs
- Group edge choosability of planar graphs without adjacent short cycles
- scientific article; zbMATH DE number 2172647 (Why is no real title available?)
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- Two Chromatic Conjectures: One for Vertices and One for Edges
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Planar graphs without cycles of specific lengths
- Edge-choosability of planar graphs without non-induced 5-cycles
- Structural properties and edge choosability of planar graphs without 4-cycles
This page was built for publication: Edge choosability of planar graphs without short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880873)
