Graph Edge Coloring: A Survey

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

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


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
Issue number1
StatePublished - Jan 2 2019
Externally publishedYes


  • Adjacency lemma
  • Chromatic index
  • Edge coloring

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Graph Edge Coloring: A Survey'. Together they form a unique fingerprint.

Cite this