Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Every planar map is four colorable, Part I. Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable, Part II. Reducibility;Appel;Illinois J. Math.,1977
3. T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces large complete bipartite graph minors, preprint
4. Highly linked graphs;Bollobás;Combinatorica,1996
5. Graphs with forbidden subgraphs;Chartrand;J. Combin. Theory Ser. B,1971
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献