Jiménez, AndreaAndreaJiménezQuiroz, DanielDanielQuirozChristopher Thraves Caro2025-12-062025-12-062024-01-0210.1016/j.disc.2023.1138622-s2.0-85181680219https://cris-uv-2.scimago.es/handle/123456789/7122WOS:001152442100001The 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.enacceso restringidoDiscrete Mathematics And CombinatoricsMathematicsTheoretical Computer Sciencearticle