Asymmetric $2$-colorings of graphs

Erica Flapan, Sarah Rundell, Madeline Wyse

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we ch…