Combinatorics · Mathematics
($P_2+P_4$, $K_4-e$)-free graphs are nearly $\omega$-colorable
C. U. Angeliya, T. Karthick, Shenwei Huang
2025-08-08
Combinatorics · Mathematics
A tight linear chromatic bound for ($P_3\cup P_2, W_4$)-free graphs
Rui Li, Jinfeng Li, Di Wu
2023-08-21
Combinatorics · Mathematics
A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs
Wei Dong, Baogang Xu, Yian Xu
2022-08-01
Combinatorics · Mathematics
Optimal chromatic bound for ($P_3\cup P_2$, house)-free graphs
Rui Li, Di Wu, Jinfeng Li
2023-08-11
Combinatorics · Mathematics
Coloring graphs with no induced five-vertex path or gem
M. Chudnovsky, T. Karthick, P. Maceli, Frederic Maffray
2021-10-07
Combinatorics · Mathematics
An Optimal $\chi$-Bound for ($P_6$, diamond)-Free Graphs
Kathie Cameron, Shenwei Huang, Owen Merkel
2018-09-05
Combinatorics · Mathematics
Three-coloring triangle-free graphs without long forbidden paths
Yidong Zhou, Jorik Jooken, Baoyuan Shan, Jan Goedgebeur +1
2025-12-24
Combinatorics · Mathematics
Coloring ($P_6$, diamond, $K_4$)-free graphs
T. Karthick, Suchismita Mishra
2017-03-03