We study the chromatic number of graphs that exclude a clique as a strong odd immersion and have independence number two. Given a graph $G$ and $t\in\mathbb{Z}^+$, we prove that if $α(G)\leq 2$ and $G$ has no strong odd $K_t$-immersion, then $χ(G)\leq \lceil \frac{3(t-1)}{2}\rceil$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。