Abstract
The famous Four-colour Problem (FCP) of planar maps is equivalent, by an optimally fast reduction, to the problem of Colouring Pairs of Binary Trees (CPBT). Extant proofs of FCP lack conciseness, lucidity and require hours of electronic computation. The search for a satisfactory proof continues and, in this spirit, we explore two approaches to CPBT. In the first, we prove that a satisfactory proof exists if the rotational path between the two trees of the problem instance always satisfies a specific condition embodied in our Shortest Path Conjecture. In our second approach, we look for patterns of colourability within regular forms of tree pairs and seek to understand all instances of CPBT as a perturbation of these. In this Colouring Topologies approach, we prove, for instance, that concise proofs to CPBT exist for instances contained within many infinite-sized sets of trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karel Culik II and Derick Wood. A note on some tree similarity measures. Information Processing Letters. Volume 15:1, (1982), pages 39–42.
Artur Czumaj and Alan Gibbons, Guthrie’s problem: new equivalences and rapid reductions, Theoretical Computer Science, Volume 154, Issue 1, 3–22, January 1996.
Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press (1985).
Alan Gibbons. Problems on pairs of trees equivalent to the four colour problem of planar maps. Second British Colloquium for Theoretical Computer Science, Warwick, March 1986.
K. Appel and W. Haken. Every planar map is four colourable. Part I. Discharging. Illinois Journal of Mathematics 21 (1977), 429–490.
K. Appel, W. Haken and J. Koch. Every planar map is four colourable. Part II. Reducibility. Illinois Journal of Mathematics 21 (1977), 491–567.
K. Appel and W. Haken. Every planar map is four colourable. Comtemporary Mathematics 98 (1989) entire issue.
John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company (1979).
Ming Li and Louxin Zhang. Twist-rotation transformations of binary trees and arithmetic expressions. Journal of Algorithms, Volume 32:2, (1999), pages 155–166.
Jean Pallo. On the rotation distance in the lattice of Binary Trees. Information Processing Letters. Volume 25:6, (1987), pages 369–373.
N. Robertson, D. P. Sanders, P.D. Seymour and R. Thomas. A new proof of the four-colour theorem. Electron. Res. Announc.Amer. Math. Soc. 2 (1996), no. 1, 17–25 also: The four colour theorem, J. Combin. Theory Ser. B. 70 (1997), 2–44.
Rodney Rogers. On finding shortest paths in the rotation graph of binary trees. Congressus Numerantium 137 (1999), 77–95.
T. L. Saaty and P. C. Kainen. The Four-Colour Problem: Assaults and Conquest. McGraw-Hill (1977).
Daniel D. Sleator, Robert E. Tarjan and William P. Thurston. Rotation Distance, Triangulations and Hyperbolic Geometry. Journal of the American Mathematical Society. Volume 1 (1988), pages 647–682.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gibbons, A., Sant, P. (2002). Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive