Total choosability of planar graphs with maximum degree 4
Resource
Discrete Applied Mathematics, 159(1), 87-89
Journal
Discrete Applied Mathematics
Pages
87-89
Date Issued
2011
Date
2011
Author(s)
Roussel, Nicolas
Abstract
Let G be a planar graph with maximum degree 4. It is known that G is 8-totally choosable. It has been recently proved that if G has girth g6, then G is 5-totally choosable. In this note we improve the first result by showing that G is 7-totally choosable and complete the latter one by showing that G is 6-totally choosable if G has girth at least 5. © 2010 Elsevier B.V. All rights reserved.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
62.pdf
Size
23.45 KB
Format
Adobe PDF
Checksum
(MD5):7242586b769fb352c348d180ec10d651