Equitable list coloring of graphs with bounded degree

Henry Kierstead, A. V. Kostochka

Research output: Contribution to journalArticle

5 Citations (Scopus)

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

Fingerprint

Equitable Coloring
List Coloring
Maximum Degree
Graph in graph theory
Polynomial Algorithm
Colouring
Assignment

Keywords

  • choosable
  • equitable coloring
  • list coloring
  • maximum degree

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Equitable list coloring of graphs with bounded degree. / Kierstead, Henry; Kostochka, A. V.

In: Journal of Graph Theory, Vol. 74, No. 3, 11.2013, p. 309-334.

Research output: Contribution to journalArticle

Kierstead, Henry ; Kostochka, A. V. / Equitable list coloring of graphs with bounded degree. In: Journal of Graph Theory. 2013 ; Vol. 74, No. 3. pp. 309-334.
@article{296c34e41a9b4c12a8fd807204f6a603,
title = "Equitable list coloring of graphs with bounded degree",
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 {\^a}Œ̂|G|/k{\^a}Œ‰ 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.",
keywords = "choosable, equitable coloring, list coloring, maximum degree",
author = "Henry Kierstead and Kostochka, {A. V.}",
year = "2013",
month = "11",
doi = "10.1002/jgt.21710",
language = "English (US)",
volume = "74",
pages = "309--334",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - Equitable list coloring of graphs with bounded degree

AU - Kierstead, Henry

AU - Kostochka, A. V.

PY - 2013/11

Y1 - 2013/11

N2 - 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.

AB - 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.

KW - choosable

KW - equitable coloring

KW - list coloring

KW - maximum degree

UR - http://www.scopus.com/inward/record.url?scp=84883547892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883547892&partnerID=8YFLogxK

U2 - 10.1002/jgt.21710

DO - 10.1002/jgt.21710

M3 - Article

AN - SCOPUS:84883547892

VL - 74

SP - 309

EP - 334

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -