Publisher
Springer Nature Switzerland
Reference18 articles.
1. Audemard, G., Simon, L.: Glucose 4.1 (2016). https://www.labri.fr/perso/lsimon/research/glucose/
2. Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. No. 66, 72 (1966)
3. Cohen, G.D., Honkala, I., Lobstein, A., Zémor, G.: Bounds for codes identifying vertices in the hexagonal grid. SIAM J. Discrete Math. 13(4), 492–504 (2000). https://doi.org/10.1137/S0895480199360990
4. Cranston, D.W., West, D.B.: An introduction to the discharging method via graph coloring. Discrete Math. 340(4), 766–793 (2017). https://doi.org/10.1016/j.disc.2016.11.022
5. Hopcroft, J.: An $$n$$ log $$n$$ algorithm for minimizing states in a finite automaton. In: Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971), pp. 189–196. Academic Press, New York (1971)