


















Abstract:We prove that graphs that do not contain a totally odd immersion of $K_t$ are $\mathcal{O}(t)$-colorable. In particular, we show that any graph with no totally odd immersion of $K_t$ is the union of a bipartite graph and a graph which forbids an immersion of $K_{\mathcal{O}(t)}$. Our results are algorithmic, and we give a fixed-parameter tractable algorithm (in $t$) to find such a decomposition.
From: Caleb McFarland [view email]
[v1]
Mon, 11 Aug 2025 15:57:58 UTC (22 KB)
[v2]
Tue, 19 Aug 2025 21:00:41 UTC (22 KB)
[v3]
Thu, 2 Jul 2026 14:14:35 UTC (25 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。