Ken-ichi Kawarabayashi, Bruce A. Reed. Hadwiger s conjecture is decidable. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 445-454, ACM, 2009. [doi]
@inproceedings{KawarabayashiR09:0, title = {Hadwiger s conjecture is decidable}, author = {Ken-ichi Kawarabayashi and Bruce A. Reed}, year = {2009}, doi = {10.1145/1536414.1536476}, url = {http://doi.acm.org/10.1145/1536414.1536476}, researchr = {https://researchr.org/publication/KawarabayashiR09%3A0}, cites = {0}, citedby = {0}, pages = {445-454}, booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, editor = {Michael Mitzenmacher}, publisher = {ACM}, isbn = {978-1-60558-506-2}, }