Author:
Eickmeyer Kord,Kawarabayashi Ken-ichi
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Chen, Z.Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127–138 (2002)
2. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, pp. 194–242. Elsevier, Amsterdam (1990)
3. Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)
4. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Logic in Computer Science (LICS), pp. 270–279 (2007)
5. GTM;R Diestel,2012
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 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
2. Modulo-counting first-order logic on bounded expansion classes;Discrete Mathematics;2023-09
3. First-Order Model Checking on Structurally Sparse Graph Classes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Twin-width I: Tractable FO Model Checking;Journal of the ACM;2022-02-28
5. Twin-width I: tractable FO model checking;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11