paper

Graphs that contain a and no induced subdivision of are -colorable

arXiv:2305.03889

Abstract

In 2012, Lévêque, Maffray, and Trotignon conjectured that each graph that contains no induced subdivision of is -colorable. In this paper, we prove that this conjecture holds when contains a .