Gašper Fijavž: Distinguishing chromatic number of planar graphs

A vertex-labelling l of a graph G is called distinguishing if no nonidentity automorphism preserves l. We will prove that every 3-connected planar graph G admits a 5-distinguishing labelling of G which is also a proper vertex coloring. We will use 4CT, though.