1. Byskov, J.M.: Exact algorithms for graph colouring and exact satisfiability. Ph.D. thesis, University of Aarbus, Denmark (2005)
2. De Ita, G., Marcial-Romero, R., Lopez, P., Gonzalez, M.: Linear-time algorithms for computing the Merrifield-Simmons index on polygonal trees. MATCH Commun. Math. Comput. Chem. 79(1), 55–78 (2018)
3. Došlić, T., Måløy, F.: Chain hexagonal cacti: matchings and independent sets. Discret. Math. 310, 1676–1690 (2010)
4. Dvor̃ák, Z., Král, D., Thomas, R.: Three-coloring triangle-free graphs on surfaces. In: Proceedings of 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 120–129 (2009)
5. Mertzios, G.B., Spirakis, P.G.: Algorithms and almost tight results for 3-colorability of small diameter graphs. Technical report (2012).
arxiv.org/pdf/1202.4665v2.pdf