Injective colorings of sparse graphs
Combinatorics
2011-10-12 v1
Abstract
Let denote the maximum average degree (over all subgraphs) of and let denote the injective chromatic number of . We prove that if , then ; and if , then . Suppose that is a planar graph with girth and . We prove that if , then ; similarly, if , then .
Keywords
Cite
@article{arxiv.1007.0786,
title = {Injective colorings of sparse graphs},
author = {Daniel W. Cranston and Seog-Jin Kim and Gexin Yu},
journal= {arXiv preprint arXiv:1007.0786},
year = {2011}
}
Comments
10 pages