Balanced Polychromatic 2-Coloring of Triangulations
Balanced Polychromatic 2-Coloring of Triangulations
复制标题
DOI:
10.1007/s00373-021-02420-8
复制
发表时间:
2021-12
影响因子:
0.7
通讯作者:
Yoshihiro Asayama;Naoki Matsumoto
中科院分区:
文献类型:
--
作者:
Yoshihiro Asayama;Naoki Matsumoto
It is well-known that every triangulation on a closed surfacehas a spanning quadrangulationQ, and in particular,Qis bipartite ifis the sphere. In other words, every triangulation on the sphere has a polychromatic 2-coloring, which is a (not necessarily proper) 2-coloring of a graph on a closed surface without a monochromatic face. In this paper, we consider the balancedness of a polychromatic 2-coloring of graphs, that is, whether the difference in size of each color class is at most one. We verify that every 3-colorable triangulation has a balanced polychromatic 2-coloring. On the other hand, we construct an infinite family of triangulationsGwith ordernon the sphere such that for every polychromatic 2-coloring ofG, the size of color classes differs at least. Then we conjecture that every triangulation on the sphere has a polychromatic 2-coloring whose size of color classes differs at most one-third of the number of vertices, and we give partial solutions for the conjecture.