Funder
National Research Foundation of Korea
Institute for Basic Science
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. Obstructions for linear rank-width at most 1;Adler;Discrete Appl. Math.,2014
2. Connectivity of isotropic systems;Bouchet,1989
3. Upper bounds to the clique width of graphs;Courcelle;Discrete Appl. Math.,2000
4. Vertex-minors, monadic second-order logic, and a conjecture by Seese;Courcelle;J. Comb. Theory, Ser. B,2007
5. Computing small pivot-minors;Dabrowski,2018
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Vertex-minors of graphs: A survey;Discrete Applied Mathematics;2024-07
2. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Transducing paths in graph classes with unbounded shrubdepth;European Journal of Combinatorics;2022-12
4. Stable graphs of bounded twin-width;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
5. Tree Pivot-Minors and Linear Rank-Width;SIAM Journal on Discrete Mathematics;2021-01