Indexed by:
Abstract:
In 2012, Leveque, 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.
Keyword:
Reprint 's Address:
Email:
Version:
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 Discipline: MATHEMATICS;
ESI HC Threshold:50
JCR Journal Grade:4
CAS Journal Grade:4
Cited Count:
WoS CC Cited Count: 3
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: