Asymmetric $2$-colorings of graphs

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 characterize all graphs which have the property that their edges can be $2$-colored so that no matter how the graph is emb...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Flapan, Erica, Rundell, Sarah, Wyse, Madeline
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Geometric Topology
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!