List edge-colouring and total colouring in graphs of low treewidth

Henning Bruhn; Richard Lang; Maya Stein

List edge-colouring and total colouring in graphs of low treewidth

Combinatorics 2013-11-14 v1

Authors: Henning Bruhn , Richard Lang , Maya Stein

Abstract

We prove that the list chromatic index of a graph of maximum degree $\Delta$ and treewidth $\leq \sqrt{2\Delta} -3$ is $\Delta$ ; and that the total chromatic number of a graph of maximum degree $\Delta$ and treewidth $\leq \Delta/3 +1$ is $\Delta +1$ . This improves results by Meeks and Scott.

Keywords

list chromatic index total chromatic number treewidth maximum degree graph coloring

Cite

@article{arxiv.1311.2969,
  title  = {List edge-colouring and total colouring in graphs of low treewidth},
  author = {Henning Bruhn and Richard Lang and Maya Stein},
  journal= {arXiv preprint arXiv:1311.2969},
  year   = {2013}
}

Comments

10 pages

Related papers

View all related →