抄録
For a 3-vertex coloring, a face of a triangulation whose vertices receive all three colors is called a vivid face with respect to it. In this paper, we show that for any triangulation G with n faces, there exists a coloring of G with at least 1/2n faces and construct an infinite series of plane triangulations such that any 3-coloring admits at most 1/5 (3n - 2) vivid faces.
本文言語 | English |
---|---|
ページ(範囲) | 157-162 |
ページ数 | 6 |
ジャーナル | Ars Combinatoria |
巻 | 75 |
出版ステータス | Published - 2005 4月 |
ASJC Scopus subject areas
- 数学 (全般)