On colorings of squares of outerplanar graphs

We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of the maximum degree of G for all N. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of G2 when 7. In the case of chordal outerplanar graphs, we classify exactly which graphs have parameters exceeding the absolute minimum. 2000 MSC: 05C05, 05C12, 05C15.

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Geir Agnarsson, Magnús M. Halldórsson
• Keywords: Algorithms, Optimal Bound, Outerplanar Graph G, Outerplanar Graphs, SODA 2004