Abstract
Abstract
From time to time in a graph-theoretical career one’s thoughts turn to the Four Colour Problem. It occurred to me once that it might be possible to get results of interest in the theory of map-colourings without actually solving the Problem. For example it might be possible to find the average number of 4-colourings, on vertices, for planar triangulations of a given size.
Publisher
Oxford University PressOxford