Author:
Das Sandip,Mukherjee Joydeep,Sahoo Uma kant
Publisher
Springer International Publishing
Reference9 articles.
1. Ageev, A.A.: Every circle graph of girth at least 5 is 3-colourable. Discret. Math. 195(1), 229–233 (1999)
2. Asplund, E., Grünbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)
3. Das, S., Mukherjee, J., Sahoo, U.K.: Outerstring graphs of girth at least five are 3-colorable. In preparation (2021)
4. Das, S., Mukherjee, J., Sahoo, U.K.: Outerstring graphs of girth at least five are 3-colorable. In: Proceedings of EuroCG 2021, pp. 70:1 – 70:7 (2021)
5. Esperet, L., Ochem, P.: On circle graphs with girth at least five. Discret. Math. 309(8), 2217–2222 (2009)