The complete chromatic number of some planar graphs (Q1312961): Difference between revisions

The authors consider simultaneous colouring of vertices, edges and faces of a planar connected graph \(G\) (without cut vertex) in which any two adjacent or incident elements are coloured by different colours. Let \(c(G)\) be a minimum number of colours for such type of colouring of elements of \(G\). Authors prove that if \(G\) is an outerplanar graph with maximum vertex degree \(h(G) \geq 7\), or planar graph with order \(p \geq 9\) and \(h(G) \geq p-2\), or maximal planar graph with \(h(G) \geq 14\), then \(c(G)=h+1\).