Funder
Grantová Agentura Ceské Republiky
Ministerstvo Školství, Mládeže a Telovýchovy
Univerzita Karlova v Praze
Austrian Science Fund
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference38 articles.
1. Battle, J., Harary, F., Kodama, Y., Youngs, J.W.T.: Additivity of the genus of a graph. Bull. Am. Math. Soc. 68, 565–568 (1962)
2. Böhme, T., Kawarabayashi, K., Maharry, J., Mohar, B.: $K_{3,k}$-minors in large $7$-connected graphs (2008). http://preprinti.imfm.si/PDF/01051.pdf
3. Böhme, T., Kawarabayashi, K., Maharry, J., Mohar, B.: Linear connectivity forces large complete bipartite minors. J. Combin. Theory Ser. B 99(3), 557–582 (2009)
4. Bouchet, A.: Orientable and nonorientable genus of the complete bipartite graph. J. Combin. Theory Ser. B 24(1), 24–33 (1978)
5. de Caen, D.: The ranks of tournament matrices. Am. Math. Mon. 98(9), 829–831 (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounding Radon Numbers via Betti Numbers;International Mathematics Research Notices;2024-04-01