(Δ + 1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles
Journal
Discrete Mathematics
Journal Volume
312
Journal Issue
14
Pages
2126-2130
Date Issued
2012
Author(s)
Abstract
Let G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-total choosable if G has no cycle of length from 4 to k and has minimum distance at least dΔ between triangles for (Δ(G),k,dΔ)=(6,4,1),(5,5,2),(5,6,1),(5,7,0),(4,6,3), (4,7,2),(4,10,1). © 2011 Elsevier B.V. All rights reserved.
Type
journal article