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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
