Properties of minimal charts and their applications. VI: The graph _m+1 in a chart of type (m;2,3,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

(m; 2, 3, 2)

if

w (G a m m a) = 7

,

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

,

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

, 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 if there is a minimal chart

G a m m a

of type

(m; 2, 3, 2)

, then each of

G a m m a_{m + 1}

and

G a m m a_{m + 2}

contains one of three kinds of graphs. In the next paper, we shall prove that there is no minimal chart of type

(m; 2, 3, 2)

.

Recommendations

Cited in

(4)

This page was built for publication: Properties of minimal charts and their applications. VI: The graph \(\Gamma_{m+1}\) in a chart \(\Gamma\) of type \((m;2,3,2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997754)