3-Coloring $P_t$-Free Graphs With Only One Prescribed Induced Odd Cycle Length

Yidong Zhou, Mingxian Zhong, Shenwei Huang

A graph is $P_t$-free if it contains no induced subgraph isomorphic to a $t$-vertex path. A graph is not bipartite if and only if it contains an induced subgraph isomorphic to a $k…