Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

If G is a planar graph, we may add edges to construct a maximal planar graph H containing G, so that H triangulates the sphere. If G is toroidal, then by adding edges we can extend G to a maximal ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Publications of the Astronomical Society of the Pacific, Vol. 103, No. 662 (April 1991), pp. 359-367 (9 pages) We have computer evolved 2850 triple systems possessing very simplified properties: ...