Contoh graph

• Figure 10(b), (c) shows the possible continuation of those graphs.

• Nevertheless, it seems likely that the results proved in this paper for huge graphs remain true for graphs of much more modest size.

• There are no such o simple formulas known for general outerplanar graphs.

• In this paper, we investigate results of the same type, which are known as splitter theorems, for cubic graphs.

• Let us first introduce the smallest cubic graphs, the only two on two vertices.

• The class of graphs which attain this bound is characterised.

• We close this section with some remarks concerning other base graphs.

• The second theme is to illustrate the use of induction in proving such results about graphs and matroids.

• The class of graphs with tree-width at most three requires four excluded minors [1].

• We introduce new operations, particular for the class of graphs with path-width at most two.

• In many instances (such as undirected graphs and other symmetric relations) this is also a natural definition of a subobject.

• However, this is not possible in the unimodular case of unweighted graphs.

• The example in the immediately preceding paragraph shows that such graphs exist.

• Here we will need a slight extension of that result, assuming that only two out of the three bipartite graphs are -regular.

• The properties of such graphs in which is much smaller than d have been studied extensively.