On Colorings of Squares of Outerplanar Graphs
| dc.creator | Agnarsson, Geir | |
| dc.creator | Halldorsson, Magnus Mar | |
| dc.date | 2007-06-11 | |
| dc.date.accessioned | 2026-07-07T08:04:57Z | |
| dc.date.available | 2026-07-07T08:04:57Z | |
| dc.description | We study vertex colorings of the square $G^2$ of an outerplanar graph $G$. We find the optimal bound of the inductiveness, chromatic number and the clique number of $G^2$ as a function of the maximum degree $Δ$ of $G$ for all $Δ\in \nats$. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of $G^2$ when $Δ\geq 7$. In the case of chordal outerplanar graphs, we classify exactly which graphs have parameters exceeding the absolute minimum. | |
| dc.description | 24 pages, 17 figures | |
| dc.identifier | https://arxiv.org/abs/0706.1526 | |
| dc.identifier | http://arxiv.org/abs/0706.1526 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130150 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | On Colorings of Squares of Outerplanar Graphs | |
| dc.type | text |