Author:
Böhme Thomas,Kawarabayashi Ken-ichi,Maharry John,Mohar Bojan
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference72 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. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
4. T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, K3,k-minors in large 7-connected graphs, submitted for publication
5. Disjoint Kr-minors in large graphs with given average degree;Böhme;European J. Combin.,2005
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献