Author:
Geelen Jim,Gerards Bert,Reed Bruce,Seymour Paul,Vetta Adrian
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Every planar map is 4-colourable, Part I: Discharging;Appel;Illinois J. Math.,1977
2. Sur le couplage maximum d'un graphe;Berge;C. R. Math. Acad. Sci. Paris,1958
3. Packing non-zero A-paths in group-labeled graphs;Chudnovsky;Combinatorica,2006
4. On independent circuits contained in a graph;Erdős;Canad. J. Math.,1965
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hadwiger’s conjecture and topological bounds;European Journal of Combinatorics;2024-12
2. Integer programs with bounded subdeterminants and two nonzeros per row;Journal of the ACM;2024-09-13
3. Search-Space Reduction via Essential Vertices;SIAM Journal on Discrete Mathematics;2024-08-30
4. Coloring hypergraphs with excluded minors;European Journal of Combinatorics;2024-08
5. Packing Even Directed Circuits Quarter-Integrally;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10