The chromatic number of { ISK4, diamond, bowtie}-free graphs - 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：

A　graph　is　said　to　be　(Formula　presented.)　-free　if　it　does　not　contain　any　subdivision　of　(Formula　presented.)　as　an　induced　subgraph.　Lévêque,　Maffray　and　Trotignon　conjectured　that　every　(Formula　presented.)　-free　graph　is　4-colorable.　In　this　paper,　we　show　that　this　conjecture　is　true　for　the　class　of　{　(Formula　presented.),　diamond,　bowtie}-free　graphs,　where　a　diamond　is　the　graph　obtained　from　(Formula　presented.)　by　removing　one　edge　and　a　bowtie　is　the　graph　consisting　of　two　triangles　with　one　vertex　identified.　©　2020　Wiley　Periodicals　LLC

Keyword：

ISK4; bowtie; chromatic number; diamond; subdivision

Community：

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

Reprint 's Address：

[Liu, Q.]Center for Discrete Mathematics, Fuzhou UniversityChina

Email：

qliu@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Journal of Graph Theory

ISSN： 0364-9024

Year： 2020

0 . 8 5 7

JCR@2020

0 . 9 0 0

JCR@2023

ESI HC Threshold：50

JCR Journal Grade：3

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 2

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