Tootfinder

List coloring ordered graphs with forbidden induced subgraphs
Marta Piecyk, Pawe{\l} Rz\k{a}\.zewski
https://arxiv.org/abs/2509.22160 https://arxiv.org/pdf…

List coloring ordered graphs with forbidden induced subgraphs
In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list. The complexity of the problem in classes defined by forbidding induced subgraphs is a widely studied topic in algorithmic graph theory. Recently, Hajebi, Li, and Spirkl [SIAM J. Discr. Math. 38 (2024)] initiated the study of List $3$-Coloring in ordered grap…