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

author：

Chang, Gerard Jennhwa (Chang, Gerard Jennhwa.) ^[1] | Hou, Jianfeng (Hou, Jianfeng.) ^[2] | Roussel, Nicolas (Roussel, Nicolas.) ^[3]

Indexed by：

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

Keyword：

Graphic methods Graph theory

Community：

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

Reprint 's Address：

Email：

houjianfeng@mail.sdu.edu.cn

Show more details

Related Keywords：

The further results of the chromatic uniqueness of certain bipartite graphs K (m, n)- A
2008，Journal of Donghua University (English Edition)
On partitions of theta-free multigraphs under degree constraints
2025，Computational and Applied Mathematics
List total weighting of graphs
2010，Meeting on Fete of Combinatorics and Computer Science
A minimum spanning tree based image segmentation algorithm with closed-form solution
2014，Journal of Harbin Institute of Technology
A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
2016，Journal of Algorithms and Computational Technology

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： 0

SCOPUS Cited Count： 10

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 4

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search Engineering Village

Type
Departments

All Years Choose Year From to