On the Strong Parity Chromatic Number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discussiones Mathematicae Graph Theory Year : 2011

On the Strong Parity Chromatic Number


A vertex colouring of a 2-connected plane graph G is a strong parity vertex colouring if for every face f and each colour c, the number of vertices incident with f coloured by c is either zero or odd. Czap et al. [Discrete Math. 311 (2011) 512-520] proved that every 2-connected plane graph has a proper strong parity vertex colouring with at most 118 colours. In this paper we improve this upper bound for some classes of plane graphs.
Fichier principal
Vignette du fichier
CJKa11.pdf (146.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00634956 , version 1 (09-11-2011)


  • HAL Id : inria-00634956 , version 1


Július Czap, Stanislav Jendrol', František Kardoš. On the Strong Parity Chromatic Number. Discussiones Mathematicae Graph Theory, 2011, 31 (3), pp.587-600. ⟨inria-00634956⟩
146 View
168 Download


Gmail Facebook Twitter LinkedIn More