|
|||||
|
|
Choosability of K5-minor-free graphs |
|
| Authors: | Riste Skrekovski |
| Institution: | Department of Mathematics, University of Ljubljana, Jadranska 19, 1111, Ljubljana, Slovenia |
| Abstract: | Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all K5-minor-free graphs are 5-choosable. |
| Keywords: | Graph Coloring List coloring |
| 本文献已被 ScienceDirect 等数据库收录！ | |