Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
