Author:
Kawarabayashi Ken-Ichi,Reed Bruce
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. T. Böhme, K. Kawarabayashi, J. Maharry and B. Mohar: Linear connectivity forces large complete bipartite graph minors, to appear in J. Combin. Theory Ser. B
99(2) (2009), 323.
2. B. Bollobás and A. Thomason: Highly linked graphs, Combinatorica
16(3) (1996), 313–320.
3. M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour: Packing non-zero A-paths in group labelled graphs, Combinatorica
26(5) (2006), 521–532.
4. I. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.
5. R. Diestel: Graph Theory, 2nd Edition, Springer, 2000.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献