A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Facial parity edge colouring of plane pseudographs
2012
Discrete Mathematics
A facial parity edge colouring of a connected bridgeless plane graph is such an edge colouring in which no two face-adjacent edges receive the same colour and, in addition, for each face f and each colour c, either no edge or an odd number of edges incident with f is coloured with c. Let χ ′ p (G) denote the minimum number of colours used in such a colouring of G. In this paper we prove that χ ′ p (G) ≤ 20 for any 2-edge-connected plane graph G. In the case when G is a 3-edge-connected plane
doi:10.1016/j.disc.2012.03.036
fatcat:e7fchi7io5he5dxz6glift72ha