On the d-distance face chromatic number of plane graphs Original Research Article

The d-distance face chromatic number of a connected plane graph G is the minimum number of colours in such a colouring of faces of G that whenever two distinct faces are at the distance at most d, they receive distinct colours. We estimate the d-distance face chromatic number from above for connected plane graphs with maximum degree at least eight.