ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2019: 0.600
Rejection Rate (2018-2019): c. 84%
Discussiones Mathematicae Graph Theory 31(3) (2011)
1 Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University of Košice Nemcovej 32, SK-04001 Košice, Slovakia 2 Institute of Mathematics, P.J. Safarik University Jesenn'a 5, SK-04001 Košice, Slovakia
Czap et al. in  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.
Keywords: plane graph, k-planar graph, vertex colouring, strong parity vertex colouring
2010 Mathematics Subject Classification: 05C15.
Received 14 September 2009
Revised 23 May 2011
Accepted 24 May 2011