CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS
CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS作者机构:Yiwu Industrial and Commercial College Yiwu 322000 China
出 版 物:《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报(英文版)(B辑))
年 卷 期:2007年第22卷第2期
页 面:163-168页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:chromatic number maximal outerplanar graph square of graph maximum degree
摘 要:Let x(G^2) denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper, it is proved that △ + 1 ≤ x(G^2) ≤△ + 2, and x(G^2) = A + 2 if and only if G is Q, where A represents the maximum degree of G.