Abstract
In this paper we study subdivision from a graph-theoretic point of view. In particular, we study the chromatic numbers of subdivision meshes, that is the number of distinct colors we need for a vertex, face or edge coloring of a subdivision mesh. We show that, unlike the size, the chromatic numbers of subdivision meshes are not larger than the corresponding chromatic numbers of the initial mesh and sometimes are even smaller. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Ivrissimtzis, I., & Seidel, H. P. (2003). Combinatorial properties of subdivision meshes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2768, 73–84. https://doi.org/10.1007/978-3-540-39422-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
