Document Type

Article

Department/Program

Mathematics

Journal Title

Discrete Mathematics

Pub Date

2012

Volume

312

Issue

5

First Page

957

Abstract

A graph has an equitable, defective k-coloring (an ED-k-coloring) if there is a k-coloring of V(G) that is defective (every vertex shares the same color with at most one neighbor) and equitable (the sizes of all color classes differ by at most one). A graph may have an ED-k-coloring, but no ED-(k + 1)-coloring. In this paper, we prove that planar graphs with minimum degree at least 2 and girth at least 10 are ED-k-colorable for any integer k >= 3. The proof uses the method of discharging. We are able to simplify the normally lengthy task of enumerating forbidden substructures by using Hall's Theorem, an unusual approach. Published by Elsevier B.V.

DOI

10.1016/j.disc.2011.10.024

Download

Share Feedback

Share

COinS