Graph Edge Coloring: A Survey

Yan Cao, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft

Research output: Contribution to journalArticle

Abstract

Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and techniques and state some of the many popular conjectures in the theory. Besides known results a new basic result about brooms is obtained.

Original languageEnglish (US)
Pages (from-to)33-66
Number of pages34
JournalGraphs and Combinatorics
Volume35
Issue number1
DOIs
StatePublished - Jan 2 2019

    Fingerprint

Keywords

  • Adjacency lemma
  • Chromatic index
  • Edge coloring

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Cao, Y., Chen, G., Jing, G., Stiebitz, M., & Toft, B. (2019). Graph Edge Coloring: A Survey. Graphs and Combinatorics, 35(1), 33-66. https://doi.org/10.1007/s00373-018-1986-5