Author:
Aboulker Pierre,Havet Frédéric,Knauer Kolja,Rambaud Clément
Publisher
Springer International Publishing
Reference12 articles.
1. Aboulker, P., Havet, F., Knauer, K., Rambaud, C.: arXiv:2102.01034 [math.CO]
2. Appel, K., Haken, W.: Every planar map is four colorable. Part I: discharging. Illinois J. Math. 21(3), 429–490 (1977)
3. Bang-Jensen, J., Bellitto, T., Stiebitz, M., Schweser, T.: Hajós and ore constructions for digraphs (2019)
4. Franklin, P.: A six-color problem. J. Math. Phys. 13, 363–369 (1934)
5. Harutyunyan, A., Mohar, B.: Gallai’s theorem for list coloring of digraphs. SIAM J. Discret. Math. 25, 170–180 (2011)