On 3-coloring of plane triangulations

Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe

Research output: Contribution to journalArticlepeer-review


Let G be a plane triangulation. For a 3-vertex-coloring λ, a face of G whose vertices receive all three colors is called a vivid face with respect to λ. Let hλ (G) be the number of vivid faces in G with respect to λ. Let C(G) be the set of 3-vertex-colorings of G and let g(n) be the set of plane triangulations with n faces. Let h(G) = max {hλ (G) {divides} λ ∈ C(G)} and h(n) = min {h(G) {divides} G ∈ g(n)}. In this paper we show that h(n) ≥ 1 2 n for any even n, and that h(n) ≤ 1 5 (3n - 2) for infinitely many n.

Original languageEnglish
Pages (from-to)519-524
Number of pages6
JournalElectronic Notes in Discrete Mathematics
Publication statusPublished - 2002 Jul 1


  • 3-coloring
  • plane triangulation
  • triangulation

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'On 3-coloring of plane triangulations'. Together they form a unique fingerprint.

Cite this