


























The immersion-analogue of Hadwiger's Conjecture states that every graph $G$ contains an immersion of $K_{χ(G)}$. This conjecture has been recently strengthened in the following way: every graph $G$ contains a totally odd immersion of $K_{χ(G)}$. We prove this stronger conjecture for line graphs of constant-multiplicity multigraphs, thus extending a result of Guyer and McDonald.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。