Quiroz, DanielDanielQuiroz2025-08-252025-08-252021-01-0110.1016/j.procs.2021.11.0422-s2.0-85122927613https://cris-uv-2.scimago.es/handle/123456789/5580WOS:000760223100037The analogue of Hadwiger's conjecture for the immersion order states that every graph G contains the complete graph KX(G) as an immersion. Like its minor-order counterpart it is open even for graphs with independence number 2. Let G and H be graphs with independence number at most 2, such that |V(H)| ≤ 4. We show that if G is H-free, then G satisfies the conjecture.enacceso abiertoComputer Scienceconference paper