On colorings of squares of outerplanar graphs

DMCA

On colorings of squares of outerplanar graphs (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Geir Agnarsson , Magnús M. Halldórsson

Venue:	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Citations:	10 - 2 self

BibTeX

@INPROCEEDINGS{Agnarsson04oncolorings,
    author = {Geir Agnarsson and Magnús M. Halldórsson},
    title = {On colorings of squares of outerplanar graphs},
    booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
    year = {2004},
    pages = {242--253},
    publisher = {}
}

OpenURL

Abstract

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 ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of G 2 when ∆ ≥ 7. In the case of chordal outerplanar graphs, we classify exactly which graphs have parameters exceeding the absolute minimum.

Keyphrases

outerplanar graph optimal bound chromatic number absolute minimum list-chromatic number clique number maximum degree chordal outerplanar graph vertex coloring

DMCA