Equitable list coloring of graphs with bounded degree

Henry Kierstead, A. V. Kostochka

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

A graph G is equitably k-choosable if for every k-list assignment L there exists an L-coloring of G such that every color class has at most âŒ̂|G|/k⌉ vertices. We prove results toward the conjecture that every graph with maximum degree at most r is equitably (r+1)-choosable. In particular, we confirm the conjecture for r≤7 and show that every graph with maximum degree at most r and at least r 3 vertices is equitably (r+2)-choosable. Our proofs yield polynomial algorithms for corresponding equitable list colorings.

Original languageEnglish (US)
Pages (from-to)309-334
Number of pages26
JournalJournal of Graph Theory
Volume74
Issue number3
DOIs
StatePublished - Nov 2013

Keywords

  • choosable
  • equitable coloring
  • list coloring
  • maximum degree

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Equitable list coloring of graphs with bounded degree'. Together they form a unique fingerprint.

  • Cite this