Funder
agence nationale de la recherche
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference38 articles.
1. Aboulker, P., Cohen, N., Havet, F, Lochet, W., Moura, P. F. S., Thomassé, S: Subdivisions in digraphs of large out-degree or large dichromatic number. Electron. J. Comb. 26(3), P3:19 (2019)
2. Andres, S. D., Hochstättler, W.: Perfect digraphs. J. Graph Theory 79(1), 21–29 (2015)
3. Baste, J., Sau, I., Thilikos, D. M.: A complexity dichotomy for hitting connected minors on bounded treewidth graphs: The chair and the banner draw the boundary. In: Chawla, S (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pp. 951–970. SIAM (2020)
4. Bensmail, J., Harutyunyan, A., Le, N-K: List coloring digraphs. J. Graph Theory 87(4), 492–508 (2018)
5. Bergougnoux, B., Bonnet, É, Brettell, N., Kwon, O-j: Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth. arXiv:2007.14179 (2020)