Author:
Bonnet Edouard,Kim Eun Jung,Thomasse Stephan,Watrigant Remi
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On (n,m)-chromatic numbers of graphs with bounded sparsity parameters;Discrete Applied Mathematics;2024-12
2. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Elementary first-order model checking for sparse graphs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
4. Twin-Width IV: Ordered Graphs and Matrices;Journal of the ACM;2024-06-13
5. Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10