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]
@inproceedings{GibbonsS02, title = {Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps}, author = {Alan Gibbons and Paul Sant}, year = {2002}, url = {http://link.springer.de/link/service/series/0558/bibs/2420/24200025.htm}, researchr = {https://researchr.org/publication/GibbonsS02}, cites = {0}, citedby = {0}, pages = {25-39}, booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings}, editor = {Krzysztof Diks and Wojciech Rytter}, volume = {2420}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-44040-2}, }