On the total choosability of planar graphs and of sparse graphs - Details

author：

Chang, G.J. (Chang, G.J..) ^[1] | Hou, J. (Hou, J..) ^[2] | Roussel, N. (Roussel, N..) ^[3]

Indexed by：

Scopus

Abstract：

In　the　current　paper,　we　prove　the　11-total　choosability　of　planar　graphs　with　maximum　degree　Δ≤8,　the　(Δ+1)-total　choosability　of　5-cycle-free　planar　graphs　with　maximum　degree　Δ≥8,　the　5-total　choosability　of　graphs　with　maximum　degree　Δ=4　and　maximum　average　degree　mad＜3,　and　the　4-total　choosability　of　subcubic　graphs　with　maximum　average　degree　mad＜94.　©　2010　Elsevier　B.V.

Keyword：

Combinatorial problems; Cycle-free; Maximum average degree; Planar graphs; Total choosability; Total coloring

Community：

[ 1 ] [Chang, G.J.]National Taiwan University, Department of Mathematics, Taipei 10617, Taiwan
[ 2 ] [Chang, G.J.]Institute for Mathematical Sciences, National Taiwan University, Taipei 10617, Taiwan
[ 3 ] [Chang, G.J.]National Center for Theoretical Sciences, Taipei Office, Taipei, Taiwan
[ 4 ] [Hou, J.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, 350002, China
[ 5 ] [Roussel, N.]National Taiwan University, Department of Mathematics, Taipei 10617, Taiwan
[ 6 ] [Roussel, N.]National Center for Theoretical Sciences, Taipei Office, Taipei, Taiwan

Reprint 's Address：

[Hou, J.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, 350002, China

Email：

houjianfeng@mail.sdu.edu.cn

Show more details

Related Keywords：

Source ：

Information Processing Letters

ISSN： 0020-0190

Year： 2010

Issue： 20

Volume： 110

Page： 849-853

0 . 6 1 2

JCR@2010

0 . 7 0 0

JCR@2023

JCR Journal Grade：4

CAS Journal Grade：4

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 10

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 8

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to