Title

Injective colorings of sparse graphs

Document Type

Article

Department/Program

Mathematics

Journal Title

Discrete Mathematics

Pub Date

2010

Volume

310

Issue

21

First Page

2965

Abstract

Let mad(G) denote the maximum average degree (over all subgraphs) of G and let chi(i)(G) denote the injective chromatic number of G. We prove that if mad(G) < 5/2, then chi(i)(C) <= Delta(G) + 1; and if mad(G) < 42/19, then chi(i)(C) = Delta(C). Suppose that G is a planar graph with girth g(G) and Delta(G) >= 4. We prove that if chi(i)(G) >= 9, then chi(i)(G) <= Delta(G) + 1; similarly, if g(G) >= 13, then chi(i)(C) = Delta(C). (C) 2010 Elsevier B.V. All rights reserved.

DOI

10.1016/j.disc.2010.07.003

This document is currently not available here.

Share

COinS