chromatic number 1extremal graph theory 1forbidden induced subgraphs 1graph coloring 1structural graph theory 1
From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
The optimal -bound for -free graphs
Yidong Zhou, Kaiyang Lan
The paper proves that any graph that does not contain an induced path on six vertices, a dart, or a K4 as an induced subgraph can be colored with at most six colors, improving the…
math.CO2025
Trisimplicial vertices in (fork, odd parachute)-free graphs
Kaiyang Lan, Feng Liu, Di Wu +1
An {\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\em odd parachute} is a graph obtained from an odd hole by adding a new ed…