1. Bok, J., Brewster, R., Feder, T., Hell, P., Jedličková, N.: List homomorphism problems for signed graphs. arXiv preprint arXiv:2005.05547 (2020)
2. Lecture Notes in Computer Science;J Bok,2022
3. Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003)
4. Chen, H., Jansen, B.M.P., Okrasa, K., Pieterse, A., Rzazewski, P.: Sparsification lower bounds for list $$H$$-coloring. In: Cao, Y., Cheng, S.-W., Li, M. (eds.) 31st International Symposium on Algorithms and Computation, ISAAC 2020, 14–18 December 2020. LIPIcs, vol. 181, pp. 58:1–58:17 (2020)
5. Chitnis, R., Egri, L., Marx, D.: List $$h$$-coloring a graph by removing few vertices. Algorithmica 78(1), 110–146 (2017)