List colourings of planar graphs
Discrete Mathematics
Restricted colorings of graphs
Surveys in combinatorics, 1993
Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
3-list-coloring planar graphs of girth 5
Journal of Combinatorial Theory Series B
A not 3-choosable planar graph without 3-cycles
Discrete Mathematics
The 4-choosability of plane graphs without 4-cycles
Journal of Combinatorial Theory Series B
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
Combinatorics, Probability and Computing
European Journal of Combinatorics
On the vertex-arboricity of planar graphs
European Journal of Combinatorics
On 3-choosability of planar graphs without certain cycles
Information Processing Letters
A Note on Edge Choosability and Degeneracy of Planar Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Information Processing Letters
Hi-index | 0.00 |
It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.