Cyclic Degrees of 3-Polytopes
暂无分享,去创建一个
Abstract. A precise upper bound is obtained for the minimum cyclic vertex degree in a 3-polytope with specified maximum face size. This implies improvements to some known upper bounds for the cyclic chromatic numbers of 3-polytopes.
[1] Yue Zhao,et al. On cyclic colorings and their generalizations , 1999, Discret. Math..
[2] Stanislav Jendrol',et al. Unavoidable set of face types for planar maps , 1996, Discuss. Math. Graph Theory.
[3] Michael D. Plummer,et al. Cyclic coloration of 3-polytopes , 1987, J. Graph Theory.
[4] G. Ringel. Ein Sechsfarbenproblem auf der Kugel , 1965 .