科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 that 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 that induces a nontrivial color-preserving automorphism of the graph.
- 出版日期2017-12
