Indexed by：
Abstract：
For a positive integer n, we use Kn and Pn to denote a complete graph and an induced path on n vertices, respectively. A subdivision of G is a graph obtained from G by replacing the edges of G with independent paths of length at least one between their end vertices. A graph is said to be ISK4-free if it does not contain any subdivision of K4 as an induced subgraph. Leveque, Maffray and Trotignon conjectured that every ISK4-free graph is 4 colorable. In this paper, we show that this conjecture is true for the class of P6-free graphs. & COPY; 2023 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE APPLIED MATHEMATICS
ISSN： 0166-218X
Year： 2023
Volume： 339
Page： 227-233
1 . 0
JCR@2023
1 . 0 0 0
JCR@2023
ESI Discipline： ENGINEERING;
ESI HC Threshold：35
JCR Journal Grade：3
CAS Journal Grade：3
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
