Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps

Alan Gibbons, Paul Sant. Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 25-39, Springer, 2002. [doi]

Abstract

Abstract is missing.