Schaum's Outline of Discrete Mathematics, Third Edition (Schaum's Outlines)

194 GRAPH THEORY [CHAP. 8

Fig. 8-63

Fig. 8-64

8.64. Find the minimum number of colors needed to paint the regions of each map in Fig. 8-64.

8.65. Draw the map which is dual to each map in Fig. 8-64.

8.66. Use the Welch-Powell algorithm to paint each graph in Fig. 8-65. Find the chromatic numbernof the graph.

Fig. 8-65

SEQUENTIAL REPRESENTATION OF GRAPHS

8.67. Find the adjacency matrixAof each multigraph in Fig. 8-66.

Fig. 8-66