Locally planar graphs are 5-choosable

Authors:
Matt DeVos;Ken-ichi Kawarabayashi;Bojan Mohar
Affiliations:
Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6, Canada;National Institute of Informatics, 2-1-2, Chiyoda-ku, Tokyo 101-8430, Japan;Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia and Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6, Canada
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Graph minors. VII. Disjoint paths on a surface

Journal of Combinatorial Theory Series B
Five-coloring maps on surfaces

Journal of Combinatorial Theory Series B
List colourings of planar graphs

Discrete Mathematics
Coloring graphs without short non-bounding cycles

Journal of Combinatorial Theory Series B
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Color-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A new lower bound on the number of edges in colour-critical graphs and hypergraphs

Journal of Combinatorial Theory Series B
The chromatic number of a graph of girth 5 on a fixed surface

Journal of Combinatorial Theory Series B
Dirac's map-color theorem for choosability

Journal of Graph Theory

Additive approximation algorithms for list-coloring minor-closed class of graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hadwiger's conjecture is decidable

Proceedings of the forty-first annual ACM symposium on Theory of computing
Output-sensitive algorithm for the edge-width of an embedded graph

Proceedings of the twenty-sixth annual symposium on Computational geometry
Asymptotic enumeration and limit laws for graphs of fixed genus

Journal of Combinatorial Theory Series A
List-coloring graphs without subdivisions and without immersions

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for the edge-width of an embedded graph

Computational Geometry: Theory and Applications
From the plane to higher surfaces

Journal of Combinatorial Theory Series B
Graphs with Two Crossings Are 5-Choosable

SIAM Journal on Discrete Mathematics

Hi-index	0.00

It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable.