Properties of minimal charts and their applications. V. Charts of type (3,2,2)

Abstract: Let

G a m m a

be a chart, and we denote by

G a m m a_{m}

the union of all the edges of label

m

. A chart

G a m m a

is of type

(3, 2, 2)

if there exists a label

m

such that

w (G a m m a) = 7

,

w (G a m m a_{m} c a p G a m m a_{m + 1}) = 3

,

w (G a m m a_{m + 1} c a p G a m m a_{m + 2}) = 2

, and

w (G a m m a_{m + 2} c a p G a m m a_{m + 3}) = 2

where

w (G)

is the number of white vertices in

G

. In this paper, we prove that there is no minimal chart of type

(3, 2, 2)

.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Properties of minimal charts and their applications. V. Charts of type \((3,2,2)\)