A Map Colour Theorem for the Union of Graphs

Abstract

In 1890 Heawood [10] established an upper bound for the chromatic number of a graph embedded on a surface of Euler genus g 1