Degenerate and star colorings of graphs on surfaces
Combinatorics
2008-06-10 v1
Abstract
We study the degenerate, the star and the degenerate star chromatic numbers and their relation to the genus of graphs. As a tool we prove the following strengthening of a result of Fertin et al.: If is a graph of maximum degree , then admits a degenerate star coloring using colors. We use this result to prove that every graph of genus admits a degenerate star coloring with colors. It is also shown that these results are sharp up to a logarithmic factor.
Keywords
Cite
@article{arxiv.0806.1242,
title = {Degenerate and star colorings of graphs on surfaces},
author = {Bojan Mohar and Simon Spacapan},
journal= {arXiv preprint arXiv:0806.1242},
year = {2008}
}
Comments
16 pages, 2 figures