Let G be a connected, loopless, and bridgeless plane graph different fromK1. Clearly χ¯ef (G) ≥ 3 in general and χ¯ef (G) ≥ 4
if G contains a face of odd size. Both bounds are tight. For example, χ¯ef (Q) = 3 for the graph Q of the cube. For upper bound
we have: