Parity vertex colouring of plane graphs Artikel uri icon

Open Access

  • true

Peer Reviewed

  • true

Abstract

  • A proper vertex colouring of a 2-connected plane graph G is a parity vertex colouring if for each face f and each colour c, either no vertex or an odd number of vertices incident with f is coloured with c. The minimum number of colours used in such a colouring of G is denoted by chi(p)(G). In this paper, we prove that chi(p)(C) <= 118 for every 2-connected plane graph G. (C) 2010 Elsevier B.V. All rights reserved.