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, …, 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 graphs, i. e. , graphs with fixed linear ordering of vertices. Forbidding ordered induced subgraphs allows us to investigate the boundary of tractability more closely. We continue this direction of research, focusing mostly on the case of List 4-Coloring. We present several algorithmic and hardness results, which altogether provide an almost complete dichotomy for classes defined by forbidding one fixed ordered graph: our investigations leave one minimal open case.
Piecyk et al. (Thu,) studied this question.