pith. sign in

arxiv: 1206.1945 · v4 · pith:5FDIGGL6new · submitted 2012-06-09 · 🧮 math.CO · math.GT

Asymmetric 2-colorings of graphs

classification 🧮 math.CO math.GT
keywords graphcolorcolorededgesgraphspreservingsurfaceasymmetric
0
0 comments X
read the original abstract

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 embedded in any orientable surface, there is no homeomorphism of the surface which induces a non-trivial color preserving automorphism of the graph.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.