Facial parity edge colouring

Július Czap, Stanislav Jendroľ, František Kardoš


A facial parity edge colouring of a connected bridgeless plane graph is an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face α and each colour c, either no edge or an odd number of edges incident with \alpha is coloured with c. From Vizing's theorem it follows that every 3-connected plane graph has a such colouring with at most Δ* + 1 colours, where Δ* is the size of the largest face. In this paper we prove that any connected bridgeless plane graph has a facial parity edge colouring with at most 92 colours.


Plane graph, facial walk, edge colouring.

Full Text:


DOI: https://doi.org/10.26493/1855-3974.129.be3

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications