List colourings of planar graphs
Discrete Mathematics
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
On structure of some plane graphs with application to choosability
Journal of Combinatorial Theory Series B
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
SIAM Journal on Discrete Mathematics
Planar graphs without cycles of specific lengths
European Journal of Combinatorics
A note on the not 3-choosability of some families of planar graphs
Information Processing Letters
A note on 3-choosability of planar graphs
Information Processing Letters
On 3-choosability of planar graphs without certain cycles
Information Processing Letters
Planar Graphs without 7-Cycles Are 4-Choosable
SIAM Journal on Discrete Mathematics
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics
| Hi-index | 0.89 |
This article has been retracted: please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy). This article has been retracted at the request of the Editor-in-Chief due to a flaw in the proof of the theorem. The publisher apologizes for any inconvenience this may cause.