Author:
Chudnovsky Maria,Seymour Paul
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference7 articles.
1. C. Berge: Sur le couplage maximum d’un graphe, C.R. Acad. Sci. Paris 247 (1958), 258–259.
2. J. Blasiak: A special case of Hadwiger’s conjecture, J. Combinatorial Theory, Ser. B, 97 (2007), 1056–1073.
3. M. Chudnovsky, S.-I. Oum and P. Seymour: Finding minimum clique capacity, Combinatorics this issue.
4. D. Dor and M. Tarsi: Graph decomposition is NP-complete: A complete proof of Holyer’s conjecture, SIAM J. Comput. 26 (1997), 1166–1187.
5. Lectures in Applied Mathematics;J. Edmonds,1968
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献