Partial Result on Hadwiger's Conjecture
暂无分享,去创建一个
[1] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .
[2] Robin Thomas,et al. The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.
[3] Robin Thomas,et al. Hadwiger's conjecture forK6-free graphs , 1993, Comb..
[4] Maria Chudnovsky,et al. An approximate version of Hadwiger's conjecture for claw-free graphs , 2010 .
[5] J. Thomas. The four color theorem , 1977 .
[6] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[7] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[8] G. Dirac. A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .
[9] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .
[10] Jonah Blasiak. A special case of Hadwiger's conjecture , 2007, J. Comb. Theory, Ser. B.
[11] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .