Author:
Robertson Neil,Seymour P.D
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. A combinatorial problem in geometry;Erdős;Compositio Math.,1935
2. Graph minors. III. Planar tree-width;Robertson;J. Combin. Theory Ser. B,1984
3. Adjacency in binary matroids;Seymour;European J. Combin.,1986
4. Disjoint paths in graphs;Seymour;Discrete Math.,1980
5. A polynomial solution to the undirected two paths problem;Shiloach;J. Assoc. Comput. Mach.,1980
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Killing a Vortex;Journal of the ACM;2024-08
2. A Flat Wall Theorem for Matching Minors in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Coarse-Grained Reconfigurable Array (CGRA);Handbook of Computer Architecture;2022-11-25
5. Killing a vortex;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10