Lescure-Meyniel conjecture holds for Gem-free graphs with independence number two
摘要
A gem is a graph that consists of an induced path on 4-vertices plus a vertex which is adjacent to all the vertices of that path. The Lescure-Meyniel conjecture is the analogue of Hadwiger’s conjecture for the immersion order. It states that for every graph G, there exists a complete graph