Author:
Kawarabayashi Ken-ichi,Mohar Bojan
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 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 minors, submitted for publication
4. Graph Theory;Diestel,2000
5. A property of 4-chromatic graphs and some remarks on critical graphs;Dirac;J. London Math. Soc.,1952
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proof of the Clustered Hadwiger Conjecture;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. On the choosability of -minor-free graphs;Combinatorics, Probability and Computing;2023-11-03
3. Local Hadwiger's Conjecture;Journal of Combinatorial Theory, Series B;2023-09
4. Breaking the degeneracy barrier for coloring graphs with no K minor;Advances in Mathematics;2023-06
5. Clustered coloring of graphs with bounded layered treewidth and bounded degree;European Journal of Combinatorics;2023-05