1. Aboulker, P., Brettell, N., Havet, F., Marx, D., Trotignon, N.: Colouring graphs with constraints on connectivity, Manuscript.
arXiv:1505.01616
2. Appel, K., Haken, W.: Every planar map is four colorable. In: Contemporary Mathematics, vol. 89. AMS Bookstore (1989)
3. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)
4. Bonomo, F., Durán, G., Marenco, J.: Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169, 3–16 (2009)
5. Brandstädt, A., Klembt, T., Mahfud, S.:
$$P_6$$
- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Math. Theor. Comput. Sci. 8, 173–188 (2006)