The Chromatic Number of Graphs with No Induced Subdivision of K4 - Details

author：

Chen, G. (Chen, G..) ^[1] | Chen, Y. (Chen, Y..) ^[2] | Cui, Q. (Cui, Q..) ^[3] | Feng, X. (Feng, X..) ^[4] | Liu, Q. (Liu, Q..) ^[5]

Indexed by：

Scopus

Abstract：

In　2012,　Lévêque,　Maffray　and　Trotignon　conjectured　that　if　a　graph　does　not　contain　an　induced　subdivision　of　K4,　then　it　is　4-colorable.　Recently,　Le　showed　that　every　such　graph　is　24-colorable.　In　this　paper,　we　improve　the　upper　bound　to　8.　©　2020,　Springer　Japan　KK,　part　of　Springer　Nature.

Keyword：

Chromatic number; ISK4; Subdivision

Community：

[ 1 ] [Chen, G.]Department of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, United States
[ 2 ] [Chen, Y.]Research Center of Nonlinear Science, School of Mathematics and Computer Science, Wuhan Textile University, Wuhan, 430073, China
[ 3 ] [Cui, Q.]Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China
[ 4 ] [Feng, X.]Faculty of Science, Jiangxi University of Science and Technology, Ganzhou, 341000, China
[ 5 ] [Liu, Q.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, 350108, China

Reprint 's Address：

[Chen, Y.]Research Center of Nonlinear Science, School of Mathematics and Computer Science, Wuhan Textile UniversityChina

Email：

chenyuanmath@hotmail.com

Show more details

Related Keywords：

Source ：

Graphs and Combinatorics

ISSN： 0911-0119

Year： 2020

Issue： 3

Volume： 36

Page： 719-728

0 . 4 9 8

JCR@2020

0 . 6 0 0

JCR@2023

ESI HC Threshold：50

JCR Journal Grade：4

CAS Journal Grade：4

Cited Count：

WoS CC Cited Count： 0

SCOPUS Cited Count： 3

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to