Antisymmetric flows and strong oriented coloring of planar graphs

Abstrakt

We give an upper bound on the number of colors needed for a strong oriented coloring of a planar graph, and hereby we find a small antisymmetric flow for any planar graph.